Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125953
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125953 a(0)=1. a(n) = sum{k=0 to n-1} (a(k)(mod n)). +0
1
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; listen)
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: A132190 A001770 A032494 this_sequence A047464 A036990 A097498

Adjacent sequences: A125950 A125951 A125952 this_sequence A125954 A125955 A125956

KEYWORD

easy,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Feb 05 2007

EXTENSIONS

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 09:40 EDT 2008. Contains 143480 sequences.


AT&T Labs Research