cp's OEIS Frontend

A213060 Lucas(n) mod n, Lucas(n)= A000032(n).

%I A213060 #18 Sep 08 2022 08:46:02
%S A213060 0,1,1,3,1,0,1,7,4,3,1,10,1,3,14,15,1,0,1,7,11,3,1,2,11,3,22,7,1,18,1,
%T A213060 31,4,3,4,34,1,3,17,7,1,18,1,7,41,3,1,2,29,23,4,7,1,0,44,47,4,3,1,22,
%U A213060 1,3,41,63,11,18,1,7,50,53,1,2,1,3,64,7,73,18
%N A213060 Lucas(n) mod n, Lucas(n)= A000032(n).
%C A213060 a(n) = 1 for all prime values of n. Composite values for which a(n) = 1 are listed in A005845.
%H A213060 T. D. Noe, <a href="/A213060/b213060.txt">Table of n, a(n) for n = 1..10000</a>
%p A213060 with(combinat):f:=n-> fibonacci(n):L:=n->f(2*n)/f(n): seq(L(n) mod n, n= 1..75)
%p A213060 # alternative
%p A213060 A213060 := proc(n::integer)
%p A213060     modp(A000032(n),n) ;
%p A213060 end proc:
%p A213060 seq(A213060(n),n=1..100) ; # _R. J. Mathar_, Oct 02 2019
%t A213060 Table[Mod[LucasL[n], n], {n, 100}] (* _T. D. Noe_, Jun 06 2012 *)
%o A213060 (Magma) [Lucas(n) mod (n) : n in [1..120]]; // _Vincenzo Librandi_, Nov 19 2015
%Y A213060 Cf. A000032, A005845.
%Y A213060 Cf. A002708 (Fibonacci(n) mod n).
%K A213060 nonn,easy
%O A213060 1,4
%A A213060 _Gary Detlefs_, Jun 03 2012