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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125953 a(0)=1. a(n) = sum{k=0 to n-1} (a(k)(mod n)). 0
1, 0, 1, 2, 4, 8, 10, 12, 14, 25, 27, 38, 34, 72, 80, 103, 95, 101, 123, 123, 133, 208, 180, 175, 177, 196, 304, 329, 335, 300, 330, 440, 396, 350, 510, 511, 491, 651, 619, 644, 632, 666, 798, 831, 827, 971, 871, 964, 984, 1045, 1091, 1104, 1360, 1269, 1153, 1213 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

MATHEMATICA

f[l_List] := Block[{n = Length[l]}, Append[l, Sum[Mod[l[[k]], n], {k, n}]]]; Nest[f, {1}, 55] (*Chandler*)

CROSSREFS

Sequence in context: A155037 A001770 A032494 * A047464 A189786 A195066

Adjacent sequences:  A125950 A125951 A125952 * A125954 A125955 A125956

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Feb 05 2007

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 07 2007

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 00:09 EST 2012. Contains 205978 sequences.