cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A091366 Primes p such that the sum of the cubes of the digits of p is prime.

This page as a plain text file.
%I A091366 #14 Jun 08 2025 16:15:42
%S A091366 11,101,113,131,139,151,193,199,223,227,241,263,269,281,283,311,337,
%T A091366 353,359,373,421,449,461,463,487,557,577,593,599,641,643,661,733,757,
%U A091366 821,823,827,829,883,887,919,953,991,997,1013,1031,1039,1051,1093,1103,1123
%N A091366 Primes p such that the sum of the cubes of the digits of p is prime.
%C A091366 Apparently, in most cases the sum of the digits of such primes is also prime, see A091365 for the exceptions.
%C A091366 I conjecture the contrary: the relative density of numbers in this sequence with prime digit sum is 0. - _Charles R Greathouse IV_, Sep 08 2010
%H A091366 Vincenzo Librandi, <a href="/A091366/b091366.txt">Table of n, a(n) for n = 1..1000</a>
%e A091366 a(1)=11 because 1^3 + 1^3 = 2 which is prime. a(10)=227 because 2^3 + 2^3 + 7^3 = 359 which is prime.
%t A091366 Select[Prime[Range[2, 200]], PrimeQ[Total[IntegerDigits[#]^3]]&] (* _Vincenzo Librandi_, Apr 13 2013 *)
%o A091366 (PARI) is(n)=my(v);if(!isprime(n),return(0));v=eval(Vec(Str(n)));isprime(sum(i=1,#v,v[i]^3)) \\ _Charles R Greathouse IV_, Sep 08 2010
%Y A091366 Cf. A046704 (primes whose digits sum to a prime) A052034 (primes whose digits squared sum to a prime) A091365 (primes whose digits cubed sum to a prime but whose digits do not sum to a prime).
%K A091366 base,nonn
%O A091366 1,1
%A A091366 _Chuck Seggelin_, Jan 03 2004
%E A091366 a(44) = 997 inserted by _Charles R Greathouse IV_, Sep 08 2010