cp's OEIS Frontend

A285691 a(1) = 2; a(n + 1) = smallest prime > a(n) such that a(n + 1) - a(n) is the product of six primes.

%I A285691 #11 Nov 28 2019 22:52:09
%S A285691 2,1217,1361,1601,1697,1913,2129,2273,2417,2633,2729,2953,3049,3209,
%T A285691 3433,3529,3593,3833,3929,4073,4217,4441,4657,4721,4817,5153,5297,
%U A285691 5393,5717,5813,6029,6173,6269,6829,7069,7213,7309,7549,7789
%N A285691 a(1) = 2; a(n + 1) = smallest prime > a(n) such that a(n + 1) - a(n) is the product of six primes.
%C A285691 First differences: 1215, 144, 240, 96, 216, 216, 144, 144, 216, 96, 224, 96, 160, 224, 96, 64, 240, 96, 144, 144, ...
%H A285691 Robert Israel, <a href="/A285691/b285691.txt">Table of n, a(n) for n = 1..10000</a>
%p A285691 A[1]:= 2: p:= 2: n:= 1:
%p A285691 while n < 60 do
%p A285691     p:= nextprime(p);
%p A285691     if numtheory:-bigomega(p-A[n]) = 6 then n:= n+1; A[n]:= p;
%p A285691     fi
%p A285691 od:
%p A285691 seq(A[i],i=1..60); # _Robert Israel_, Nov 28 2019
%t A285691 NestList[Module[{p = NextPrime@ #}, While[PrimeOmega[p - #] != 6, p = NextPrime@ p]; p] &, 2, 38] (* _Michael De Vlieger_, Apr 25 2017 *)
%Y A285691 Cf. A255609, A285688, A285689, A285690.
%K A285691 nonn
%O A285691 1,1
%A A285691 _Zak Seidov_, Apr 25 2017