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!)
A121167 a(1)=1; a(n) = the reversal of (a(n-1) + spd(a(n-1))), where spd(n)= sum of powers of the digits of n. 0

%I #3 Dec 15 2017 17:37:05

%S 1,2,6,26664,298661,386985404,646010808,218856976,288157046,460585223,

%T 736514774,427530937,259106618,767004366,507197867,489519319,

%U 2141658661,3329758512,3706874373,2129616273,8563597152,3644768698,9667076604

%N a(1)=1; a(n) = the reversal of (a(n-1) + spd(a(n-1))), where spd(n)= sum of powers of the digits of n.

%Y Cf. A045503.

%K base,easy,nonn

%O 1,2

%A _Jason Earls_, Aug 14 2006

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 23 02:50 EDT 2024. Contains 371906 sequences. (Running on oeis4.)