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

%I #11 Oct 30 2022 15:30:44

%S 2,59051,62507,64811,66347,67883,71339,73643,81707,83243,87083,89387,

%T 91691,95531,99371,100907,104491,110251,115883,119723,121259,126443,

%U 127979,136043,139627,141931,143467,145771,148331

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

%C First differences: 59049, 3456, 2304, 1536, 1536, 3456, 2304, 8064, 1536, 3840, 2304, 2304, ...

%t NestList[Module[{p = NextPrime@ #}, While[PrimeOmega[p - #] != 10, p = NextPrime@ p]; p] &, 2, 28] (* _Michael De Vlieger_, Apr 25 2017 *)

%Y Cf. A255609, A285688, A285689, A285690, A285691, A285692, A285693.

%K nonn

%O 1,1

%A _Zak Seidov_, Apr 25 2017