A354443 a(n) = Fibonacci(n^n) mod n.

0, 1, 2, 3, 0, 0, 6, 3, 7, 5, 1, 0, 12, 7, 10, 11, 16, 0, 1, 15, 5, 3, 22, 0, 0, 3, 20, 7, 1, 0, 1, 27, 13, 1, 5, 0, 36, 3, 25, 35, 1, 0, 42, 19, 20, 21, 46, 0, 36, 25, 17, 3, 52, 0, 5, 35, 34, 1, 1, 0, 1, 3, 43, 59, 15, 30, 66, 35, 44, 35, 1, 0, 72, 3, 50, 3, 2, 60, 1, 75, 7

Offset: 1

Author

Chittaranjan Pardeshi, May 29 2022

Keywords

• nonn
• look

Links

• Chai Wah Wu, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A000045, A002708, A001175.

Programs

PARI

fibmod(n,m) = lift(((Mod([1,1;1,0], m))^n)[1,2]); \\ as from A001175
a(n) = fibmod(n^n,n);

Python

# uses A001175 python function from A001175
from sympy import fibonacci
def A354443(n): return fibonacci(pow(n,n,A001175(n))) % n # Chai Wah Wu, May 31 2022