login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046017 Least k > 1 with k = sum of digits of k^n, or 0 if no such k exists. 6
2, 9, 8, 7, 28, 18, 18, 46, 54, 82, 98, 108, 20, 91, 107, 133, 80, 172, 80, 90, 90, 90, 234, 252, 140, 306, 305, 90, 305, 396, 170, 388, 170, 387, 378, 388, 414, 468, 449, 250, 432, 280, 461, 280, 360, 360, 350, 370, 270, 685, 360, 625, 648, 370, 677, 684, 370, 667, 370, 694, 440, 855, 827, 430, 818 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

First non-occurrence happens with exponent 105. There is no x such that sum-of-digits{x^105}=x (x>1).

a(13)=20: 20^13=81920000000000000, 8+1+9+2=20; a(17)=80: 80^17=225179981368524800000000000000000, 2+2+5+1+7+9+9+8+1+3+6+8+5+2+4+8 = 80.

REFERENCES

Joe Roberts, "Lure of the Integers", The Mathematical Association of America, 1992, p. 172.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

EXAMPLE

a(3) = 8 since 8^3 = 512 and 5+1+2 = 8; a(5) = 28 because 28 is least number > 1 with 28^5 = 17210368, 1+7+2+1+0+3+6+8 = 28. 53^7 = 1174711139837 -> 1+1+7+4+7+1+1+1+3+9+8+3+7 = 53.

a(10) = 82 because 82^10 = 13744803133596058624 and 1 + 3 + 7 + 4 + 4 + 8 + 0 + 3 + 1 + 3 + 3 + 5 + 9 + 6 + 0 + 5 + 8 + 6 + 2 + 4 = 82.

CROSSREFS

Cf. A046459, A046000, A046471, A061211.

Cf. A133509 (n for which a(n)=0), A152147 (table of k for each n)

Sequence in context: A077601 A090930 A151927 * A155909 A069815 A162954

Adjacent sequences:  A046014 A046015 A046016 * A046018 A046019 A046020

KEYWORD

base,nonn,nice

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

EXTENSIONS

Additional comments from Patrick De Geest, Aug 15 1998. More terms from Asher Natan Auel (auela(AT)reed.edu), Jun 01 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 20:08 EST 2012. Contains 205957 sequences.