The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A135207 a(n)=Sum_digits{n^Sum_digits[a(n-1)]}, with a(0)=1. 0
 1, 1, 2, 9, 19, 40, 18, 28, 37, 45, 1, 2, 9, 46, 67, 81, 64, 55, 54, 73, 7, 36, 55, 49, 99, 109, 64, 63, 64, 34, 18, 55, 76, 81, 73, 73, 72, 82, 79, 90, 19, 49, 99, 136, 82, 63, 64, 70, 54, 73, 40, 27, 82, 82, 72, 82, 70, 72, 91, 49, 36, 64, 91, 99, 145, 79, 126, 82, 58, 126, 28 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS 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:=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. A047912, A066588, A108827. Sequence in context: A031316 A173663 A294546 * A274853 A264670 A026541 Adjacent sequences:  A135204 A135205 A135206 * A135208 A135209 A135210 KEYWORD easy,nonn AUTHOR Paolo P. Lava and Giorgio Balzarotti, Dec 03 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.

Last modified April 3 15:51 EDT 2020. Contains 333197 sequences. (Running on oeis4.)