login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 28 16:41 EDT 2024. Contains 372091 sequences. (Running on oeis4.)