A002726 a(n) = Fibonacci(n+1) mod n.

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, 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, 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

Offset: 1

Author

John C. Hallyburton, Jr. (hallyb(AT)evms.ENET.dec.com)

Keywords

• nonn

Links

• T. D. Noe, Table of n, a(n) for n=1..5000

Crossrefs

Cf. A000045, A002708.

Programs

Mathematica

Table[Mod[Fibonacci[n+1],n],{n,6!}] (* Vladimir Joseph Stephan Orlovsky, Feb 18 2010 *)

PARI

a(n)=fibonacci(n+1)%n

Extensions

More terms from Michael Somos, Apr 26 2000