login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006050 Smallest number of additive persistence n.
(Formerly M4683)
9
0, 10, 19, 199, 19999999999999999999999 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

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

Table of n, a(n) for n=0..4.

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, A045646.

Sequence in context: A121725 A110368 * A045646 A212594 A023916 A172503

Adjacent sequences:  A006047 A006048 A006049 * A006051 A006052 A006053

KEYWORD

nonn,base,nice

AUTHOR

N. J. A. Sloane.

EXTENSIONS

Next term is 1 followed by 2222222222222222222222 9s.

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 22 20:13 EST 2014. Contains 249827 sequences.