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!)
A169732 a(1) = 1000; for n>1, a(n) = a(n-1) - digitsum(a(n-1)). 4

%I #4 Mar 28 2020 12:57:44

%S 1000,999,972,954,936,918,900,891,873,855,837,819,801,792,774,756,738,

%T 720,711,702,693,675,657,639,621,612,603,594,576,558,540,531,522,513,

%U 504,495,477,459,441,432,423,414,405,396,378,360,351,342,333,324,315,306,297,279,261,252,243,234,225,216,207,198,180,171,162,153,144,135,126,117,108,99,81,72,63,54,45,36,27,18,9,0,0,0,0,0,0,0,0,0

%N a(1) = 1000; for n>1, a(n) = a(n-1) - digitsum(a(n-1)).

%p f:=proc(n) global S; option remember; if n=1 then RETURN(S) else RETURN(f(n-1)-digsum(f(n-1))); fi; end; S:=1000; [seq(f(n),n=1..120)];

%t NestList[#-Total[IntegerDigits[#]]&,1000,100] (* _Harvey P. Dale_, Mar 28 2020 *)

%Y Cf. A169733, A000045, A004207, A007618, A065075, A010077, A065076, A065124, A169734, A169735.

%K nonn,base

%O 1,1

%A _N. J. A. Sloane_, May 01 2010, based on a suggestion from Chris Cole

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 August 1 23:38 EDT 2024. Contains 374819 sequences. (Running on oeis4.)