A091362 -id:A091362 - cp's OEIS frontend

A091368 Primes p such that the sum of the digits of p is not prime, but the sum of each digit raised to the 4th power is prime.

1699, 2689, 6199, 6829, 6991, 7477, 8089, 8269, 8629, 9619, 12589, 15289, 19069, 19609, 20599, 20959, 21589, 21859, 23857, 25189, 25819, 25873, 25981, 27259, 27529, 27583, 28069, 28537, 28573, 28591, 28753, 29059, 29527, 29581, 29851

Offset: 1

Chuck Seggelin, Jan 03 2004

Apparently, for primes such that each digit raised to the 4th power sum to a prime, it is more likely that the digits themselves also sum to a prime. In the first 10,000 primes there are 760 primes whose digits raised to the 4th power sum to a prime. Of these, only 106 are such that the sums of the digits are not prime. Interestingly, all of these primes have a digit sum of 25 or 35. Essentially this sequence is the terms of A091367 (primes whose digits raised to the 4th power sum to a prime) that do not also appear in A046704 (primes whose digits sum to a prime).

			a(1)=1699 because 1+6+9+9 = 25 which is not prime, but 1^4 + 6^4 + 9^4 + 9^4 = 14419 which is prime.

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Cf. A046704 (primes whose digits sum to a prime) A091367 (primes whose digits raised to the 4th power sum to a prime) A052034 and A091362 (same observation for digits squared) A091366 and A091365 (same observation for digits cubed).

pnpQ[n_]:=Module[{idn=IntegerDigits[n]},!PrimeQ[Total[idn]]&&PrimeQ[ Total[ idn^4]]]; Select[Prime[Range[4000]],pnpQ] (* Harvey P. Dale, Apr 26 2018 *)

A121614 Numbers that have composite sum of digits and prime sum of squares of digits.

Original entry on oeis.org

27, 45, 54, 72, 78, 87, 126, 159, 162, 168, 186, 195, 207, 216, 234, 243, 249, 261, 267, 270, 276, 294, 324, 342, 348, 357, 375, 384, 405, 423, 429, 432, 438, 450, 483, 492, 504, 519, 537, 540, 573, 591, 612, 618, 621, 627, 672, 678, 681, 687, 702, 708, 720

Offset: 1

Tanya Khovanova, Sep 08 2006

			For example: the sum of digits of 27 is 9 which is composite; the sum of squares of digits of 27 is 53 which is prime.

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

Cf. A091362 (Primes p such that the sum of the digits of p is not prime, but the sum of the squares of the digits of p is prime) is a prime subsequence of this sequence.

sod[k_, m_] := Plus @@ (IntegerDigits[k]^m); Select[ Table[n, {n, 1000}], (! PrimeQ[sod[ #, 1]] && PrimeQ[sod[ #, 2]]) &]

cp's OEIS Frontend

A091368 Primes p such that the sum of the digits of p is not prime, but the sum of each digit raised to the 4th power is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica