A349239 a(n) = n + (reversal of digits in the Zeckendorf representation of n).
0, 2, 3, 4, 8, 6, 12, 11, 9, 18, 16, 15, 24, 14, 28, 24, 22, 36, 22, 36, 32, 22, 44, 37, 33, 55, 32, 54, 47, 33, 55, 48, 44, 66, 35, 70, 58, 51, 86, 48, 83, 71, 48, 83, 71, 64, 99, 51, 86, 74, 67, 102, 64, 99, 87, 56, 112, 92, 80, 136, 74, 130, 110, 72, 128, 108
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 < 65: n += 1 print(n + RevFibToNum(NumToFib(n)), end = ", ") # A.H.M. Smeets, Nov 14 2021
Comments