Binet type formula for Tribonacci sequence with arbitrary initial numbers
From MaRDI portal
Publication:2000307
Recommendations
- Binet's formula for generalized tribonacci numbers
- Binomial tribonacci sums
- scientific article; zbMATH DE number 3745266
- Formula for Fibonacci sequence with arbitrary initial numbers
- scientific article; zbMATH DE number 7372516
- scientific article; zbMATH DE number 3859211
- scientific article; zbMATH DE number 36118
- Tribonacci numbers with indices in arithmetic progression and their sums
- scientific article; zbMATH DE number 7315047
- Convolution identities for Tribonacci-type numbers with arbitrary initial values
Cites Work
- scientific article; zbMATH DE number 5800594 (Why is no real title available?)
- scientific article; zbMATH DE number 5542625 (Why is no real title available?)
- scientific article; zbMATH DE number 3745266 (Why is no real title available?)
- scientific article; zbMATH DE number 3764017 (Why is no real title available?)
- scientific article; zbMATH DE number 3556183 (Why is no real title available?)
- scientific article; zbMATH DE number 3582155 (Why is no real title available?)
- scientific article; zbMATH DE number 1408148 (Why is no real title available?)
- A Generalized Fibonacci Sequence
- Binet's formula for generalized tribonacci numbers
- Formula for Fibonacci sequence with arbitrary initial numbers
- Generalized tricobsthal and generalized tribonacci polynomials
- On a new class of hyperbolic functions
- Polynomials whose coefficients are generalized tribonacci numbers
- The numbers of repeated palindromes in the Fibonacci and Tribonacci words
- The zero-multiplicity of third-order linear recurrences associated to the Tribonacci sequence
Cited In (4)
This page was built for publication: Binet type formula for Tribonacci sequence with arbitrary initial numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000307)