login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #4 Aug 24 2012 10:50:00

%S 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,

%T 109,64,63,64,34,18,55,76,81,73,73,72,82,79,90,19,49,99,136,82,63,64,

%U 70,54,73,40,27,82,82,72,82,70,72,91,49,36,64,91,99,145,79,126,82,58,126,28

%N a(n)=Sum_digits{n^Sum_digits[a(n-1)]}, with a(0)=1.

%p 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);

%Y Cf. A047912, A066588, A108827.

%K easy,nonn

%O 0,3

%A _Paolo P. Lava_ and _Giorgio Balzarotti_, Dec 03 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:06 EDT 2024. Contains 371967 sequences. (Running on oeis4.)