|
Search: id:A134534
|
|
|
| A134534 |
|
Numbers n such that the sum of the digits of 11^n is prime. |
|
+0
4
|
|
| 1, 9, 10, 11, 13, 15, 19, 21, 22, 25, 31, 32, 51, 52, 57, 58, 59, 62, 63, 68, 69, 70, 75, 76, 80, 81, 84, 91, 93, 95, 98, 99, 100, 101, 103, 107, 109, 114, 117, 124, 131, 132, 133, 135, 137, 139, 142, 153, 158, 159, 161, 164, 175, 176, 182, 190, 192, 194, 198, 207
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
11^9=2357947691 and 2+3+5+7+9+4+7+6+9+1=53 is prime
|
|
MAPLE
|
P:=proc(n)local cont, i, k, w; if isprime(n) then cont:=0; while cont<1000 do cont:=cont+1; w:=0; k:=n^cont; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; if isprime(w) then print(cont); fi; od; fi; end: P(11);
|
|
CROSSREFS
|
Cf. A076203, A134532, A134533, A134535.
Sequence in context: A045550 A031047 A120193 this_sequence A125004 A085514 A086446
Adjacent sequences: A134531 A134532 A134533 this_sequence A134535 A134536 A134537
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Oct 30 2007
|
|
|
Search completed in 0.002 seconds
|
