A formula for an infinite family of Fibonacci-word sequences

MaRDI QIDQ4556791zbMATH OpenFDO

Authors Martin Griffiths

Publication date 28 November 2018

Full work available at URL https://www.fq.math.ca/Papers/56-1/GriffithsmgFibWordSeq121517.pdf

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Recommendations

• Publication:3033770
• Some properties of the Fibonacci sequence on an infinite alphabet
• scientific article; zbMATH DE number 3947643
• scientific article; zbMATH DE number 36117
• scientific article; zbMATH DE number 1111405

Cited in

(7)

• scientific article; zbMATH DE number 4183705 (Why is no real title available?)
• scientific article; zbMATH DE number 4132165 (Why is no real title available?)
• scientific article; zbMATH DE number 895316 (Why is no real title available?)
• Some properties of the Fibonacci sequence on an infinite alphabet
• On a matrix arising from a family of iterated self-compositions
• Fibonacci word patterns in two-way infinite Fibonacci words
• More properties of the Fibonacci word on an infinite alphabet

This page was built for publication: A formula for an infinite family of Fibonacci-word sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556791)