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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118470 Numbers n for which s(n)+s(n^2)+s(n^3) = s(n^4). 0
0, 162, 171, 351, 468, 558, 1620, 1710, 2106, 3321, 3510, 4023, 4680, 5121, 5247, 5544, 5580, 5868, 8001, 10008, 10071, 10224, 10305, 10503, 10818, 11025, 11241, 11511, 12321, 12654, 12888, 13239, 14004, 14301, 15471, 15876, 16011, 16200 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

s(n) stands for the sum of the digits of n.

LINKS

Table of n, a(n) for n=1..38.

EXAMPLE

a(2)=162 because s(162)=9, s(162^2)=18, s(162^3)=27, s(162^4)=54 and 9+18+27=54

MATHEMATICA

Select[Range[0, 20000], Sum[i*(DigitCount[ # ][[i]] + DigitCount[ #^2][[i]] + DigitCount[ #^3][[i]]), {i, 1, 9}] == Sum[i*DigitCount[ #^4][[i]], {i, 1, 9}] &] -Stefan Steinerberger, May 04 2006

s[n_] := Plus @@ IntegerDigits@n; Select[ Range[0, 16217], s@# + s[ #^2] + s[ #^3] == s[ #^4] &] - Robert G. Wilson v, May 04 2006

CROSSREFS

Sequence in context: A203334 A203053 A214164 * A081724 A025374 A025365

Adjacent sequences:  A118467 A118468 A118469 * A118471 A118472 A118473

KEYWORD

nonn,base

AUTHOR

Luc Stevens (lms022(AT)yahoo.com), May 04 2006

EXTENSIONS

More terms from Joshua Zucker, May 11 2006

STATUS

approved

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 May 23 05:24 EDT 2013. Contains 225585 sequences.