The complex-type Fibonacci p-Sequences

Deveci, Ö; Shannon, AG; Karaduman, E

The complex-type Fibonacci p-Sequences

Deveci, Ö Shannon, AG Karaduman, E

Permalink

Publisher:: University of Craiova
Publication Type:: Journal Article
Citation:: Annals of the University of Craiova, Mathematics and Computer Science Series, 2022, 49, (2), pp. 260-269
Issue Date:: 2022-01-01

Closed Access

	Filename	Description	Size
	1534-7013-1-PB.pdf		348.61 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Deveci, Ö
dc.contributor.author	Shannon, AG
dc.contributor.author	Karaduman, E
dc.date.accessioned	2023-04-06T01:53:16Z
dc.date.available	2023-04-06T01:53:16Z
dc.date.issued	2022-01-01
dc.identifier.citation	Annals of the University of Craiova, Mathematics and Computer Science Series, 2022, 49, (2), pp. 260-269
dc.identifier.issn	1223-6934
dc.identifier.issn	2246-9958
dc.identifier.uri	http://hdl.handle.net/10453/169261
dc.description.abstract	In this paper, we define a new sequence which is called the complex-type Fibonacci p-sequence and we obtain the generating matrix of this complex-type Fibonacci p-sequence. We also derive the determinantal and the permanental representations. Then, using the roots of the characteristic polynomial of the complex-type Fibonacci p-sequence, we produce the Binet formula for this defined sequence. In addition, we give the combinatorial representations, the generating function, the exponential representation and the sums of the complex-type Fibonacci p-numbers
dc.language	en
dc.publisher	University of Craiova
dc.relation.ispartof	Annals of the University of Craiova, Mathematics and Computer Science Series
dc.relation.isbasedon	10.52846/AMI.V49I2.1534
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0101 Pure Mathematics
dc.title	The complex-type Fibonacci p-Sequences
dc.type	Journal Article
utslib.citation.volume	49
utslib.for	0101 Pure Mathematics
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
utslib.copyright.status	closed_access	*
dc.date.updated	2023-04-06T01:53:15Z
pubs.issue	2
pubs.publication-status	Published
pubs.volume	49
utslib.citation.issue	2

Abstract:

In this paper, we define a new sequence which is called the complex-type Fibonacci p-sequence and we obtain the generating matrix of this complex-type Fibonacci p-sequence. We also derive the determinantal and the permanental representations. Then, using the roots of the characteristic polynomial of the complex-type Fibonacci p-sequence, we produce the Binet formula for this defined sequence. In addition, we give the combinatorial representations, the generating function, the exponential representation and the sums of the complex-type Fibonacci p-numbers

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/169261