|
Search: id:A064867
|
|
|
| A064867 |
|
The minimal number which has multiplicative persistence 3 in base n. |
|
+0
8
|
|
| 26, 63, 68, 23, 27, 31, 35, 39, 43, 46, 50, 54, 58, 62, 66, 69, 73, 77, 81, 85, 89, 92, 96, 100, 104, 108, 112, 115, 119, 123, 127, 131, 135, 138, 142, 146, 150, 154, 158, 161, 165, 169, 173, 177, 181, 184, 188, 192
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
The persistence of a number is the number of times you need to multiply the digits together before reaching a single digit.
|
|
LINKS
|
M. R. Diamond and D. D. Reidpath, A counterexample to a conjuncture of Sloane and Erdos, J. Recreational Math., 1998 29(2), 89-92. [Broken link?]
Sascha Kurz, Persistence in different bases
C. Rivera, Minimal prime with persistence p
N. J. A. Sloane, The persistence of a number, J. Recreational Math., 6 (1973), 97-98.
Eric Weisstein's World of Mathematics, Multiplicative Persistence
|
|
FORMULA
|
a(n) = 4*n-[n/6] for n > 5
|
|
EXAMPLE
|
a(3)=26 because 26=[222]->[22]->[11]->[1], and no fewer n has persistence 3 in base 3.
|
|
CROSSREFS
|
Cf. A003001, A031346, A064868, A064869, A064870, A064871, A064872.
Sequence in context: A039413 A043236 A044016 this_sequence A020155 A063304 A116300
Adjacent sequences: A064864 A064865 A064866 this_sequence A064868 A064869 A064870
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Oct 08 2001
|
|
|
Search completed in 0.002 seconds
|
