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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109710 Numbers n such that the sum of the digits of pi(n)^prime(n) is divisible by n. 1
1, 10, 35, 63, 106, 153, 602, 1548, 1710, 4680, 5274 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Next term after 5274 is greater than 10000.

LINKS

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

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 * A000447 A052472 A272352

Adjacent sequences:  A109707 A109708 A109709 * A109711 A109712 A109713

KEYWORD

base,hard,more,nonn

AUTHOR

Ryan Propper, Aug 08 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 14:59 EST 2019. Contains 329262 sequences. (Running on oeis4.)