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!)
A067670 Smallest prime of additive persistence n. 0
2, 11, 19, 199, 29998999999999999999999 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
a(5) >= 29*10^2222222222222222222221-1, the next number of additive persistence 5 after A006050(5). (a(5) is not equal to A006050(5) because that number is divisible by 313.) - Pontus von Brömssen, Oct 17 2023
REFERENCES
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, Additive Persistence
FORMULA
a(n) >= A006050(n). - Pontus von Brömssen, Oct 17 2023
EXAMPLE
a(2) = 19, 19 -> 10 -> 1, so 2 summation steps are required to reach a single-digit number.
CROSSREFS
Sequence in context: A217308 A105076 A103200 * A217071 A159879 A017185
KEYWORD
hard,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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 12:26 EDT 2024. Contains 371254 sequences. (Running on oeis4.)