|
Search: id:A108859
|
|
|
| A108859 |
|
Numbers n such that n divides the sum of the digits of n^(2n). |
|
+0
1
|
|
| 1, 3, 5, 9, 18, 63, 72, 74, 104, 111, 116, 117, 565, 621, 734, 1242, 1620, 4596, 4728, 5823, 5956
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Next term after 5956, if it exists, is greater than 10,000.
|
|
EXAMPLE
|
734 is a term because the sum of the integer digits of 734^(2*734), 19084, is divisible by 734.
|
|
MATHEMATICA
|
Do[If[Mod[Plus @@ IntegerDigits[n^(2*n)], n] == 0, Print[n]], {n, 1, 10000}]
|
|
CROSSREFS
|
Sequence in context: A108227 A028411 A018098 this_sequence A032385 A071384 A078066
Adjacent sequences: A108856 A108857 A108858 this_sequence A108860 A108861 A108862
|
|
KEYWORD
|
base,hard,more,nonn
|
|
AUTHOR
|
Ryan Propper (rpropper(AT)stanford.edu), Jul 11 2005
|
|
|
Search completed in 0.002 seconds
|
