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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125677 a(0) = a(1) = 1; for n>1, a(n) = a(n-2) + a(n-1) (mod n). 1
1, 1, 2, 3, 5, 3, 8, 4, 12, 7, 19, 15, 22, 24, 32, 26, 42, 34, 58, 35, 73, 45, 74, 50, 76, 51, 101, 71, 116, 71, 127, 74, 137, 79, 148, 87, 163, 102, 189, 135, 204, 175, 211, 214, 249, 238, 257, 260, 277, 292, 319, 305, 364, 351, 391, 357, 412, 370, 434, 391, 465, 429 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Ivan Neretin, Table of n, a(n) for n = 0..10000

MATHEMATICA

f[l_List] := Append[l, l[[ -2]] + Mod[l[[ -1]], Length[l]]]; Nest[f, {1, 1}, 63] (* Ray Chandler, Feb 08 2007 *)

CROSSREFS

Cf. A096535.

Sequence in context: A225680 A107685 A161984 * A051358 A211245 A107473

Adjacent sequences:  A125674 A125675 A125676 * A125678 A125679 A125680

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Jan 30 2007

EXTENSIONS

Extended by Ray Chandler, Feb 08 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 19:27 EST 2019. Contains 329987 sequences. (Running on oeis4.)