|
| |
|
|
A067670
|
|
Smallest prime of additive persistence n.
|
|
0
|
| |
|
|
|
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 a single-digit number.
|
|
|
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
|
| |
|
|
