A345291 a(n) is the least k >= 0 such that A345290(k) = n.
0, 3, 2, 15, 9, 8, 11, 10, 63, 37, 36, 39, 33, 32, 35, 34, 47, 41, 40, 43, 42, 255, 149, 148, 151, 145, 144, 147, 146, 159, 133, 132, 135, 129, 128, 131, 130, 143, 137, 136, 139, 138, 191, 165, 164, 167, 161, 160, 163, 162, 175, 169, 168, 171, 170, 1023, 597
Offset: 0
Examples
We have: n | 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 ----------+------------------------------------------------------------------ A345290(n)| 0 -1 2 1 -3 -4 -1 -2 5 4 7 6 2 1 4 3 -8 -9 - so a(0) = 0, a(2) = 2, a(1) = 3, a(5) = 8, a(4) = 9, a(7) = 10, a(6) = 11, a(3) = 15.
Links
- Rémy Sigrist, Table of n, a(n) for n = 0..6764
- Rémy Sigrist, Binary plot of the first Fibonacci(13) = 233 terms
- Rémy Sigrist, PARI program for A345291
Programs
-
PARI
\\ See Links section.
Comments