Binet's formula for generalized tribonacci numbers
DOI10.1080/0020739X.2015.1031837zbMATH Open1337.97003OpenAlexW2035324556MaRDI QIDQ2809002FDOQ2809002
Authors: José Luis Cereceda
Publication date: 27 May 2016
Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020739x.2015.1031837
Recommendations
characteristic equationsymmetric functionBinet's formulatribonacci numbersgeneralized tribonacci sequence
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Number theory (educational aspects) (97F60)
Cites Work
Cited In (18)
- The generalized Tribonacci \(p\)-numbers and applications
- Gaussian Padovan and Gaussian Perrin numbers and properties of them
- On generalization for Tribonacci trigintaduonions
- Binomial tribonacci sums
- Binet type formula for Tribonacci sequence with arbitrary initial numbers
- A class of generalized Tribonacci sequences applied to counting problems
- De Moivre's formula, or Binet or Lamé's formula: proof and some generalities related with the generalized sequence of Fibonacci -- GFS
- In Search of Comrade Agronomof: Some Tribonacci History
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quadratic approximation of generalized Tribonacci sequences
- The generalized Tribonacci numbers with negative subscripts
- Title not available (Why is that?)
- Title not available (Why is that?)
- A simplified Binet formula for \(k\)-generalized Fibonacci numbers
- Title not available (Why is that?)
- Examination of generalized Tribonacci dual quaternions
- Title not available (Why is that?)
This page was built for publication: Binet's formula for generalized tribonacci numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2809002)