|
Search: id:A067670
|
|
|
| A067670 |
|
Smallest prime of additive persistence n. |
|
+0
1
|
| |
|
|
OFFSET
|
0,1
|
|
|
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, Link to a section of The World of Mathematics.
|
|
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: A067660 A103200 A105076 this_sequence A017185 A092595 A116990
Adjacent sequences: A067667 A067668 A067669 this_sequence A067671 A067672 A067673
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Shyam Sunder Gupta (guptass(AT)rediffmail.com), Feb 23 2002
|
|
|
Search completed in 0.002 seconds
|
