|
Search: id:A109710
|
|
|
| A109710 |
|
Numbers n such that the sum of the digits of pi(n)^prime(n) is divisible by n. |
|
+0
1
|
|
| 1, 10, 35, 63, 106, 153, 602, 1548, 1710, 4680, 5274
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Next term after 5274 is greater than 10000.
|
|
EXAMPLE
|
The digits of pi(1548)^prime(1548) sum to 139320 and 139320 is divisible by 1548, so 1548 is in the sequence.
|
|
MATHEMATICA
|
Do[k = PrimePi[n]^Prime[n]; s = Plus @@ IntegerDigits[k]; If[Mod[s, n] == 0, Print[n]], {n, 1, 10^4}]
|
|
CROSSREFS
|
Sequence in context: A044087 A022702 A044468 this_sequence A000447 A052472 A049736
Adjacent sequences: A109707 A109708 A109709 this_sequence A109711 A109712 A109713
|
|
KEYWORD
|
base,hard,more,nonn
|
|
AUTHOR
|
Ryan Propper (rpropper(AT)stanford.edu), Aug 08 2005
|
|
|
Search completed in 0.002 seconds
|
