|
%I #17 Nov 07 2018 21:50:57
%S 0,0,0,1,3,1,0,2,1,9,1,5,0,8,12,13,0,5,1,6,8,13,0,1,18,14,21,9,1,19,1,
%T 2,25,1,17,17,0,2,27,21,1,5,0,38,8,1,0,1,8,24,18,41,0,31,52,34,22,31,
%U 1,41,1,2,42,29,3,35,0,2,47,69,1,1,0,38,57,5,76,31,1,66,55,43,0,5,3,44
%N a(n) = Fibonacci(n+1) mod n.
%H T. D. Noe, <a href="/A002726/b002726.txt">Table of n, a(n) for n=1..5000</a>
%t Table[Mod[Fibonacci[n+1],n],{n,6!}] (* _Vladimir Joseph Stephan Orlovsky_, Feb 18 2010 *)
%o (PARI) a(n)=fibonacci(n+1)%n
%Y Cf. A000045, A002708.
%K nonn
%O 1,5
%A John C. Hallyburton, Jr. (hallyb(AT)evms.ENET.dec.com)
%E More terms from _Michael Somos_, Apr 26 2000
|
