login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A002726
a(n) = Fibonacci(n+1) mod n.
2
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,5
MATHEMATICA
Table[Mod[Fibonacci[n+1], n], {n, 6!}] (* Vladimir Joseph Stephan Orlovsky, Feb 18 2010 *)
PROG
(PARI) a(n)=fibonacci(n+1)%n
CROSSREFS
Sequence in context: A117430 A354795 A143676 * A119734 A073200 A307765
KEYWORD
nonn
AUTHOR
John C. Hallyburton, Jr. (hallyb(AT)evms.ENET.dec.com)
EXTENSIONS
More terms from Michael Somos, Apr 26 2000
STATUS
approved