A349240 a(n) = n - (reversal of digits in the Zeckendorf representation of n).
0, 0, 1, 2, 0, 4, 0, 3, 7, 0, 4, 7, 0, 12, 0, 6, 10, -2, 14, 2, 8, 20, 0, 9, 15, -5, 20, 0, 9, 25, 5, 14, 20, 0, 33, 0, 14, 23, -10, 30, -3, 11, 36, 3, 17, 26, -7, 43, 10, 24, 33, 0, 40, 7, 21, 54, 0, 22, 36, -18, 46, -8, 14, 54, 0, 22, 36, -18, 62, 8, 30, 44
Offset: 0
Links
- Kevin Ryde, Table of n, a(n) for n = 0..10000
- Kevin Ryde, PARI/GP Code
Crossrefs
Programs
-
PARI
\\ See links.
-
Python
# Using functions NumToFib and RevFibToNum from A349238. n, a = 0, 0 print(a - a, end = ", ") while n < 71: n += 1 print(n - RevFibToNum(NumToFib(n)), end = ", ") # A.H.M. Smeets, Nov 14 2021