login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096534 a(1) = 0; a(2) = 1; a(n) = (a(n-1) + a(n-2)) mod n. 2
0, 1, 1, 2, 3, 5, 1, 6, 7, 3, 10, 1, 11, 12, 8, 4, 12, 16, 9, 5, 14, 19, 10, 5, 15, 20, 8, 0, 8, 8, 16, 24, 7, 31, 3, 34, 0, 34, 34, 28, 21, 7, 28, 35, 18, 7, 25, 32, 8, 40, 48, 36, 31, 13, 44, 1, 45, 46, 32, 18, 50, 6, 56, 62, 53, 49, 35, 16, 51, 67, 47, 42, 16, 58, 74, 56, 53, 31, 5, 36 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

MATHEMATICA

l = {0, 1}; For[i = 3, i <= 100, i++, len = Length[l]; l = Append[l, Mod[l[[len]] + l[[len - 1]], i]]]; l

CROSSREFS

Cf. A079777, A096535.

Sequence in context: A002752 A128047 A105870 * A139047 A191795 A121053

Adjacent sequences:  A096531 A096532 A096533 * A096535 A096536 A096537

KEYWORD

easy,nonn

AUTHOR

Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 23 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 20:13 EST 2012. Contains 205663 sequences.