A325174 a(n) = Fibonacci(n)^n mod prime(n).

1, 1, 3, 4, 1, 12, 4, 9, 19, 5, 27, 10, 30, 36, 46, 16, 27, 34, 58, 32, 9, 62, 2, 1, 53, 92, 30, 35, 76, 52, 9, 4, 70, 81, 105, 59, 61, 90, 82, 139, 19, 29, 28, 81, 92, 1, 121, 34, 155, 165, 1, 36, 178, 103, 230, 50, 266, 106, 135, 222, 272, 4, 72, 253, 182, 308, 20, 32, 166, 206

Offset: 1

Author

Vincenzo Librandi, Apr 15 2019

Keywords

• nonn
• look

Links

• Vincenzo Librandi, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A000040, A000045, A072123, A100399.

Programs

Magma

[Modexp(Fibonacci(n), n, NthPrime(n)): n in [1..70]];

Maple

a:= n-> ((<<0|1>, <1|1>>^n)[2, 1]) &^n mod ithprime(n):
seq(a(n), n=1..100);  # Alois P. Heinz, Apr 15 2019

Mathematica

Table[PowerMod[Fibonacci[n], n, Prime[n]], {n, 70}]

PARI

a(n) = lift(Mod(fibonacci(n), prime(n))^n); \\ Michel Marcus, Apr 16 2019