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.

A229570 Primes of form p*q + 30, where p and q are consecutive primes.

This page as a plain text file.
%I A229570 #11 Mar 14 2015 13:55:02
%S A229570 107,173,251,353,467,929,2521,4787,7417,8663,10433,12347,17977,19073,
%T A229570 25621,28921,32429,39233,42019,50651,55717,60521,77867,95507,97373,
%U A229570 99251,111577,116969,126757,131783,141397,159227,164039,171401,186653,194507,198937,205223
%N A229570 Primes of form p*q + 30, where p and q are consecutive primes.
%C A229570 Conjecture: The expression p*q + c  with p and q consecutive primes and c =  30 generates more primes than any other value of c in the range 1 < c < 100 and p = 48611 which is 5000th prime. Hence, c = 30 is considered for this sequence.
%H A229570 K. D. Bajpai, <a href="/A229570/b229570.txt">Table of n, a(n) for n = 1..1000</a>
%e A229570 a(1)=107: prime(4)*prime(5)+30=107, which is prime.
%e A229570 a(6)=929: prime(10)*prime(11)+30=929, which is prime.
%p A229570 KD:= proc() local a; a:= ithprime(n)*ithprime(n+1)+30; if isprime((a)) then RETURN((a)):fi;end: seq(KD(),n=1..500);
%t A229570 Select[Table[Prime[n]*Prime[n+1]+30,{n,100}],PrimeQ]
%Y A229570 Cf. A048880.
%K A229570 nonn
%O A229570 1,1
%A A229570 _K. D. Bajpai_, Sep 26 2013