a(n)=n for n<4, a(n)=A026242(n-2)+2 for all n>2, a(n)=A026272(n-4)+3 for n>4. - M. F. Hasler, Sep 17 2014
There is a 35-state automaton that accepts, in parallel, the Fibonacci (Zeckendorf) representation of n and a(n). See the file a026354.pdf. - Jeffrey Shallit, Dec 21 2023