OFFSET
1
LINKS
Jeffrey Shallit, Fibonacci automaton for a(n).
FORMULA
There is a Fibonacci automaton of 12 states computing a(n). To use it, express n in Zeckendorf representation, feed it into the automaton, and the last state reached contains the value of a(n). See the file in the Links section.
CROSSREFS
KEYWORD
nonn
AUTHOR
Jeffrey Shallit, Mar 17 2025
STATUS
approved
