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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135208 a(n)=Sum_digits{C(n,Sum_digits[a(n-1)]}, with a(0)=1. 0
1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 12, 16, 12, 14, 21, 14, 27, 29, 29, 24, 21, 16, 18, 29, 29, 36, 30, 18, 21, 22, 23, 24, 25, 26, 18, 22, 24, 24, 33, 42, 37, 46, 50, 27, 23, 33, 21, 19, 37, 48, 52, 26, 36, 33, 36, 60, 36, 42, 28, 42, 37, 36, 43, 42, 51, 60, 33, 46, 49, 64, 45 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

MAPLE

P:=proc(n) local a, i, k, w; a:=1; print(a); for i from 1 by 1 to n do w:=0; k:=a; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; k:=binomial(i, w); w:=0; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; a:=w; print(w); od; end: P(100);

CROSSREFS

Cf. A128936, A129630, A129631, A130843.

Sequence in context: A114570 A115026 A101337 * A156207 A061486 A138470

Adjacent sequences:  A135205 A135206 A135207 * A135209 A135210 A135211

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava (paoloplava(AT)gmail.com), Dec 03 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 14 17:10 EST 2012. Contains 205644 sequences.