login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067670 Smallest prime of additive persistence n. 0
2, 11, 19, 199, 29998999999999999999999 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

REFERENCES

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

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

a(2)=19, 19->10->1, so 2 summation steps are required to reach single-digit.

CROSSREFS

Cf. A003001, A045646, A006050.

Sequence in context: A217308 A105076 A103200 * A217071 A159879 A017185

Adjacent sequences:  A067667 A067668 A067669 * A067671 A067672 A067673

KEYWORD

hard,more,nonn,base

AUTHOR

Shyam Sunder Gupta, Feb 23 2002

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 22 21:05 EDT 2021. Contains 343177 sequences. (Running on oeis4.)