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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145465 a[0] = 2; a[1] = 2; for n > 1 : a[n] = a[n - 1] + a[(a[n - 1] - 1) mod n]; 0
2, 2, 4, 6, 8, 12, 24, 28, 34, 58, 86, 120, 240, 252, 504, 538, 596, 598, 604, 1108, 1136, 1138, 1676, 2784, 5568, 6166, 6172, 6710, 7308, 14616, 14628, 20800, 41600, 42708, 42714, 42966, 43564, 44068, 50234, 50236, 93202, 93236 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

CROSSREFS

Sequence in context: A091915 A123862 A089647 * A153958 A153964 A001010

Adjacent sequences:  A145462 A145463 A145464 * A145466 A145467 A145468

KEYWORD

easy,nonn

AUTHOR

Vladimir Reshetnikov (v.reshetnikov(AT)gmail.com), Oct 11 2008

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 17 14:19 EST 2012. Contains 206038 sequences.