cp's OEIS Frontend

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

%I A354443 #32 Jun 03 2022 09:25:16
%S A354443 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,
%T A354443 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,
%U A354443 1,1,0,1,3,43,59,15,30,66,35,44,35,1,0,72,3,50,3,2,60,1,75,7
%N A354443 a(n) = Fibonacci(n^n) mod n.
%H A354443 Chai Wah Wu, <a href="/A354443/b354443.txt">Table of n, a(n) for n = 1..10000</a>
%o A354443 (PARI)
%o A354443 fibmod(n,m) = lift(((Mod([1,1;1,0], m))^n)[1,2]); \\ as from A001175
%o A354443 a(n) = fibmod(n^n,n);
%o A354443 (Python)
%o A354443 # uses A001175 python function from A001175
%o A354443 from sympy import fibonacci
%o A354443 def A354443(n): return fibonacci(pow(n,n,A001175(n))) % n # _Chai Wah Wu_, May 31 2022
%Y A354443 Cf. A000045, A002708, A001175.
%K A354443 nonn,look
%O A354443 1,3
%A A354443 _Chittaranjan Pardeshi_, May 29 2022