|
Search: id:A046000
|
|
|
| A046000 |
|
a(n) is largest number m equal to the sum of digits of m^n. |
|
+0
5
|
|
| 1, 9, 9, 27, 36, 46, 64, 68, 63, 81, 117, 108, 108, 146, 154, 199, 187, 216, 181, 207, 207, 225, 256, 271, 288, 337, 324, 307, 328, 341, 396, 443, 388, 423, 463, 477, 424, 495, 469, 523, 502, 432, 531, 572, 603, 523, 592, 666, 667, 695, 685, 685, 739, 746, 739, 683, 684, 802, 754, 845, 793, 833, 865
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n) = A061211(n)^(1/n).
|
|
REFERENCES
|
Amarnath Murthy, The largest and the smallest m-th power whose digits sum /product is its m-th root. To appear in Smarandache Notions Journal, 2003.
Amarnath Murthy, e-book, " Ideas on Smarandache Notions " MS.LIT
Joe Roberts, "Lure of the Integers", The Mathematical Association of America, 1992, p. 172.
|
|
LINKS
|
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
EXAMPLE
|
a(3) = 27 since 27^3 = 19683 and 1+9+6+8+3 = 27; a(5) = 46 because 46 is largest number with 46^5 = 205962976, 2+0+5+9+6+2+9+7+6 = 46.
|
|
CROSSREFS
|
Cf. A046459, A046469, A046471, A055575, A055576, A055577, A046017.
Cf. A061211, A076090.
Sequence in context: A059816 A111005 A076089 this_sequence A003874 A097988 A103646
Adjacent sequences: A045997 A045998 A045999 this_sequence A046001 A046002 A046003
|
|
KEYWORD
|
base,nonn,nice
|
|
AUTHOR
|
David W. Wilson and Patrick De Geest (pdg(AT)worldofnumbers.com)
|
|
EXTENSIONS
|
More terms from Asher Natan Auel (auela(AT)reed.edu), Jun 01 2000
More terms from Frank Adams-Watters (FrankTAW(AT)Netscape.net), Sep 01 2006
Edited by njas at the suggestion of David Wasserman (dwasserm(AT)earthlink.net), Dec 12 2007
|
|
|
Search completed in 0.002 seconds
|
