The generalized order-\(k\) Fibonacci-Pell sequence by matrix methods

DOI10.1016/j.cam.2006.10.071zbMath1162.11013MaRDI QIDQ2475336

Emrah Kılıç

Publication date: 11 March 2008

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2006.10.071

zbMATH Keywords

matrix methods; generating function; sums; generalized Fibonacci and Pell numbers

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

15A18: Eigenvalues, singular values, and eigenvectors

11B39: Fibonacci and Lucas numbers and polynomials and generalizations

Related Items

Integer powers of certain complex tridiagonal matrices and some complex factorizations, $k$-Fibonacci numbers and $k$-Lucas numbers and associated bipartite graphs, Companion sequences associated to ther-Fibonacci sequence: algebraic andcombinatorial properties, On a new generalization of telephone numbers, The linear algebra of ther-Whitney matrices, Root location for the characteristic polynomial of a Fibonacci type sequence, The infinite sum of reciprocal Pell numbers, Identities involving generalized Fibonacci-type polynomials, The generalized Pell \((p, i)\)-numbers and their Binet formulas, combinatorial representations, sums, On \(F_3(k,n)\)-numbers of the Fibonacci type, The infinite sum of the cubes of reciprocal pell numbers, A matrix approach for divisibility properties of the generalized Fibonacci sequence, On types of distance Fibonacci numbers generated by number decompositions, On distance \((r, k)\)-Fibonacci numbers and their combinatorial and graph interpretations, The Binet formula, sums and representations of generalized Fibonacci \(p\)-numbers, On a new type of distance Fibonacci numbers, On the characteristic polynomial of \((k,p)\)-Fibonacci sequence

Cites Work

• A fast algorithm for computing large Fibonacci numbers
• A presentation of the Fibonacci algorithm
• On the number of arithmetical operations for finding Fibonacci numbers
• An O(log n) algorithm for computing general order-k Fibonacci numbers
• Computing sums of order-k Fibonacci numbers in log time
• On the order-\(k\) generalized Lucas numbers
• The combinatorial power of the companion matrix
• The generalized Binet formula, representation and sums of the generalized order-\(k\) Pell numbers
• On the generalized order-\(k\) Fibonacci and Lucas numbers
• On a class of polynomials related to classical orthogonal and Fibonacci polynomials with probability applications
• Generalized Fibonacci Numbers and Associated Matrices
• A Fast Algorithm for Computing Order-K Fibonacci Numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item