A377231 a(n) = digital root of 2^Fibonacci(n).
1, 2, 2, 4, 8, 5, 4, 2, 8, 7, 2, 5, 1, 5, 5, 7, 8, 2, 7, 5, 8, 4, 5, 2, 1, 2, 2, 4, 8, 5, 4, 2, 8, 7, 2, 5, 1, 5, 5, 7, 8, 2, 7, 5, 8, 4, 5, 2, 1, 2, 2, 4, 8, 5, 4, 2, 8, 7, 2, 5, 1, 5, 5, 7, 8, 2, 7, 5, 8, 4, 5, 2, 1, 2, 2, 4, 8, 5, 4, 2, 8, 7, 2, 5, 1, 5, 5, 7, 8, 2, 7, 5, 8, 4, 5, 2
Offset: 0
Links
- Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1).
Programs
-
Mathematica
Module[{a, n}, RecurrenceTable[{a[n] == Mod[a[n-1]*a[n-2] - 1, 9] + 1, a[0] == 1, a[1] == 2}, a, {n, 0, 99}]] (* or *) PadRight[{}, 100, {1, 2, 2, 4, 8, 5, 4, 2, 8, 7, 2, 5, 1, 5, 5, 7, 8, 2, 7, 5, 8, 4, 5, 2}] (* Paolo Xausa, Nov 08 2024 *)
Comments