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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A121103 a(1)=1; a(n) = the reversal of (a(n-1) + sfd(a(n-1))), where sfd(n)= sum of factorials of the digits of n. 1

%I #8 May 05 2023 20:08:43

%S 1,2,4,82,40404,87404,318231,765853,971218,2649731,4048103,848804,

%T 318969,6775801,3407286,9933543,56495601,78106865,70149187,49426507,

%U 81359794,56013128,99245065,21817999,30025922,63988303,26523446

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

%H Harvey P. Dale, <a href="/A121103/b121103.txt">Table of n, a(n) for n = 1..1000</a>

%t NestList[IntegerReverse[#+Total[IntegerDigits[#]!]]&,1,30] (* _Harvey P. Dale_, May 05 2023 *)

%Y Cf. A061602.

%K base,easy,nonn

%O 1,2

%A _Jason Earls_, Aug 12 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.

Last modified December 5 03:25 EST 2023. Contains 367567 sequences. (Running on oeis4.)