A134532 -id:A134532 - cp's OEIS frontend

A134533 Numbers n such that the sum of the digits of 7^n is prime.

1, 2, 4, 8, 10, 12, 18, 19, 22, 24, 25, 32, 33, 35, 45, 56, 57, 58, 59, 60, 72, 73, 76, 81, 82, 84, 88, 100, 102, 103, 104, 105, 117, 118, 125, 136, 138, 142, 147, 149, 162, 188, 190, 192, 195, 201, 203, 206, 210, 212, 232, 240, 246, 252, 262, 264, 265, 269, 270, 280

Offset: 1

Paolo P. Lava and Giorgio Balzarotti, Oct 30 2007

			7^2=49 and 4+9=13 is prime.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A076203, A134532, A134534, A134535.

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(7);

a={}; For[n=1, n<700, n++, If[PrimeQ[Plus@@IntegerDigits[7^n]], AppendTo[a, n]]];a (* Vincenzo Librandi, Apr 17 2013 *)

A134534 Numbers n such that the sum of the digits of 11^n is prime.

Original entry on oeis.org

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

Offset: 1

Paolo P. Lava and Giorgio Balzarotti, Oct 30 2007

			11^9=2357947691 and 2+3+5+7+9+4+7+6+9+1=53 is prime.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A076203, A134532, A134533, A134535.

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);

Select[Range[250],PrimeQ[Total[IntegerDigits[11^#]]]&] (* Harvey P. Dale, Sep 29 2012 *)

A134535 Numbers n such that the sum of the digits of 13^n is prime.

Original entry on oeis.org

3, 6, 10, 14, 15, 24, 30, 33, 34, 39, 40, 47, 53, 57, 61, 71, 75, 76, 80, 81, 83, 88, 89, 92, 102, 103, 106, 117, 131, 143, 144, 147, 154, 163, 170, 187, 198, 200, 205, 210, 212, 221, 227, 238, 240, 253, 255, 260, 262, 265, 271, 275

Offset: 1

Paolo P. Lava and Giorgio Balzarotti, Oct 30 2007

			13^3=2197 and 2+1+9+7=19 is prime.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A076203, A134532, A134533, A134534.

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(13);

Select[Range[250], PrimeQ[Total[IntegerDigits[13^#]]]&] (* Vincenzo Librandi, Apr 17 2013 *)

cp's OEIS Frontend

A134533 Numbers n such that the sum of the digits of 7^n is prime.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A134534 Numbers n such that the sum of the digits of 11^n is prime.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A134535 Numbers n such that the sum of the digits of 13^n is prime.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica