OFFSET
1,1
COMMENTS
Zeckendorf representation version of A023108 (base 10).
For the Zeckendorf representation of numbers see A014417.
For palindromic numbers in Zeckendorf representation see A094202.
The "Reverse and Add!" operation (A349239) applied in Zeckendorf representation seems to behave similarly to the "Reverse and Add!" operation applied in any fixed-base representation. The first 53 terms are however obtained after performing 10^4 "Reverse and Add!" steps (see Python program).
For records and record-setting values in the number of "Reverse and Add!" steps see A348572 and A348571 respectively.
Do any of these numbers have a trajectory in which the Lychrel property can be proved (like 22 in base 2 as in A061561)?
Closure of reverse operation is given by: Let Z be the regular expression for numbers in Zeckendorf representation, Z = 0|(100*)*10*, and L(Z) its corresponding regular language. Then for s in L(Z), the reversal of s is in L(0*)L(Z).
Let h be the homomorphism from Zeckendorf representation to a conventional radix representation, then addition in Zeckendorf representation, +_Z, is given by z1 +_Z z2 = h^(-1)(h(z1) + h(z2)). A direct method for addition in Zeckendorf representation is given by Ahlbach et al.
LINKS
A.H.M. Smeets, Table of n, a(n) for n = 1..20000
C. Ahlbach, J. Usatine, C. Frougny, and N. Pippenger, Efficient algorithms for Zeckendorf arithmetic, Fibonacci Quart. 51, no. 3 (2013), 249-255.
PROG
(Python) # Using functions NumToFib and RevFibToNum from A349238.
n, a = 0, 0
while n < 53:
a += 1
aa, sa = a, NumToFib(a)
ar, s = RevFibToNum(sa), 0
while aa != ar and s < 10000:
s, aa = s+1, aa+ar
sa = NumToFib(aa)
ar = RevFibToNum(sa)
if aa != ar:
n += 1
print(a, end = ", ")
CROSSREFS
KEYWORD
nonn,base
AUTHOR
A.H.M. Smeets, Oct 23 2021
STATUS
approved