Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006050
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006050 Smallest number of additive persistence n.
(Formerly M4683)
+0
6
0, 10, 19, 199, 19999999999999999999999 (list; graph; listen)
OFFSET

0,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

H. J. Hindin, The additive persistence of a number, J. Rec. Math., 7 (No. 2, 1974), 134-135.

LINKS

N. J. A. Sloane, The persistence of a number, J. Recreational Math., 6 (1973), 97-98.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

For n>1 a(n)=2*10^((a(n-1)-1)/9)-1.

CROSSREFS

Cf. A003001, A045646.

Sequence in context: A110463 A121725 A110368 this_sequence A045646 A023916 A107859

Adjacent sequences: A006047 A006048 A006049 this_sequence A006051 A006052 A006053

KEYWORD

nonn,base,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Next term is 1 followed by 2222222222222222222222 9s.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research