This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006050 Smallest number of additive persistence n. (Formerly M4683) 12
 0, 10, 19, 199, 19999999999999999999999 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS The next term a(5) is 1 followed by 2222222222222222222222 9s. REFERENCES Meimaris Antonios, On the additive persistence of a number in base p, Preprint, 2015. H. J. Hindin, The additive persistence of a number, J. Rec. Math., 7 (No. 2, 1974), 134-135. N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS N. J. A. Sloane, The persistence of a number, J. Recreational Math., 6 (1973), 97-98. Eric Weisstein's World of Mathematics, Additive Persistence. FORMULA For n>1 a(n)=2*10^((a(n-1)-1)/9)-1. MATHEMATICA lst = {0, 10}; Do[AppendTo[lst, 2*10^((lst[[-1]] - 1)/9) - 1], {3}]; lst (* Arkadiusz Wesolowski, Oct 17 2012 *) CROSSREFS Cf. A003001, A031286, A045646. Sequence in context: A121725 A110368 * A045646 A212594 A255529 A023916 Adjacent sequences:  A006047 A006048 A006049 * A006051 A006052 A006053 KEYWORD nonn,base,nice AUTHOR 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 December 11 15:53 EST 2018. Contains 318049 sequences. (Running on oeis4.)