|
| |
|
|
A031286
|
|
Additive persistence: number of summations of digits needed to obtain a single digit (the additive digital root.)
|
|
4
| |
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,20
|
|
|
COMMENTS
| The paper titled "The persistence of a number" is about multiplicative persistence: number of products of digits needed to obtain a single digit (the multiplicative digital root). - Daniel Forgues, Oct 08 2011
|
|
|
REFERENCES
| M. Gardner, Fractal Music, Hypercards and More Mathematical Recreations from Scientific American, Persistence of Numbers, pp. 120-1; 186-7, W. H. Freeman NY 1992
M. R. Diamond and D. D. Reidpath, A Counterexample to Conjectures by Sloane and Erdos Concerning the Persistence of Numbers, Journal of Recreational Mathematics, 29(2) 89-92 1998.
|
|
|
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
|
|
|
CROSSREFS
| Cf. A010888 (additive digital root of n).
Cf. A031347 (multiplicative digital root of n).
Cf. A031346 (multiplicative persistence of n).
Sequence in context: A060128 A031280 A134870 * A031276 A098744 A025429
Adjacent sequences: A031283 A031284 A031285 * A031287 A031288 A031289
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Eric Weisstein (eric(AT)weisstein.com)
|
|
|
EXTENSIONS
| Corrected by Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 05 2009
|
| |
|
|
