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.

A261832 Numbers n such that prime(n)^3 + n is prime.

This page as a plain text file.
%I A261832 #8 Sep 08 2022 08:46:13
%S A261832 2,4,6,24,32,34,36,84,86,88,112,172,182,200,212,240,258,290,306,320,
%T A261832 336,360,366,396,404,406,434,480,494,504,528,536,556,558,580,612,636,
%U A261832 718,722,732,794,906,960,966,992,994,1008,1020,1116,1132,1176,1184,1186,1212
%N A261832 Numbers n such that prime(n)^3 + n is prime.
%H A261832 K. D. Bajpai, <a href="/A261832/b261832.txt">Table of n, a(n) for n = 1..10000</a>
%e A261832 6 is in the list because prime(6)^3 + 6 = 13^3 + 6 = 2197 + 6 = 2203, which is prime.
%e A261832 24 is in the list because prime (24)^3 + 24 = 89^3 + 24 = 704969 + 24 = 704993, which is prime.
%p A261832 select(n -> isprime(ithprime(n)^3 + n), [seq(n,n=1..2000)]);
%t A261832 Select[Range[2000], PrimeQ[Prime[#]^3 + #] &]
%o A261832 (PARI) for(n = 1,2000, if(isprime(prime(n)^3 + n), print1(n,", ")));
%o A261832 (Magma) [n : n in [1..2000] | IsPrime(NthPrime(n)^3 +n)];
%Y A261832 Cf. A030078, A064402, A141526.
%K A261832 nonn
%O A261832 1,1
%A A261832 _K. D. Bajpai_, Sep 02 2015