cp's OEIS Frontend

A356296 a(n) = Fibonacci(n)^2 mod n.

%I A356296 #25 Mar 19 2024 19:16:47
%S A356296 0,1,1,1,0,4,1,1,4,5,1,0,1,1,10,9,1,10,1,5,4,1,1,0,0,1,22,9,1,10,1,25,
%T A356296 4,1,25,0,1,1,4,25,1,22,1,9,40,1,1,0,22,25,4,9,1,10,25,49,4,1,1,0,1,1,
%U A356296 22,25,25,64,1,9,4,15,1,0,1,1,25,9,4,64,1,25,49,1,1,72,25,1
%N A356296 a(n) = Fibonacci(n)^2 mod n.
%H A356296 Michael De Vlieger, <a href="/A356296/b356296.txt">Table of n, a(n) for n = 1..10000</a>
%F A356296 a(n) = A000045(n)^2 mod n.
%p A356296 A356296 := proc(n)
%p A356296     modp(combinat[fibonacci](n)^2,n) ;
%p A356296 end proc:
%p A356296 seq(A356296(n),n=1..120) ;
%t A356296 Array[PowerMod[Fibonacci[#], 2, #] &, 86] (* _Michael De Vlieger_, Aug 03 2022 *)
%o A356296 (PARI) a(n) = lift(Mod(fibonacci(n), n)^2); \\ _Michel Marcus_, Aug 03 2022
%o A356296 (Python)
%o A356296 from sympy import fibonacci
%o A356296 def a(n): return pow(fibonacci(n), 2, n)
%o A356296 print([a(n) for n in range(1, 87)]) # _Michael S. Branicky_, Aug 04 2022
%Y A356296 Cf. A000045, A002708, A023172 (location of zeros), A337231, A337232.
%K A356296 nonn,easy
%O A356296 1,6
%A A356296 _R. J. Mathar_, Aug 03 2022