|
Search: id:A108860
|
|
|
| A108860 |
|
Numbers n such that n divides the sum of the digits of (2n)^n. |
|
+0
1
|
|
| 1, 3, 9, 12, 16, 18, 22, 27, 29, 33, 48, 54, 80, 127, 133, 149, 171, 335, 888, 1038, 1137, 1435, 1465, 1647
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Next term after 1647, if it exists, is greater than 10,000.
|
|
EXAMPLE
|
888 is a term because the sum of the digits of (2*888)^888, 13320, is divisible by 888.
|
|
MATHEMATICA
|
Do[If[Mod[Plus @@ IntegerDigits[(2*n)^n], n] == 0, Print[n]], {n, 1, 10000}]
|
|
CROSSREFS
|
Sequence in context: A138921 A136290 A103531 this_sequence A006499 A140979 A096726
Adjacent sequences: A108857 A108858 A108859 this_sequence A108861 A108862 A108863
|
|
KEYWORD
|
base,hard,more,nonn
|
|
AUTHOR
|
Ryan Propper (rpropper(AT)stanford.edu), Jul 11 2005
|
|
|
Search completed in 0.002 seconds
|
