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.

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

This page as a plain text file.
%I A285694 #11 Oct 30 2022 15:30:44
%S A285694 2,59051,62507,64811,66347,67883,71339,73643,81707,83243,87083,89387,
%T A285694 91691,95531,99371,100907,104491,110251,115883,119723,121259,126443,
%U A285694 127979,136043,139627,141931,143467,145771,148331
%N A285694 a(1) = 2; a(n + 1) = smallest prime > a(n) such that a(n + 1) - a(n) is the product of 10 primes.
%C A285694 First differences: 59049, 3456, 2304, 1536, 1536, 3456, 2304, 8064, 1536, 3840, 2304, 2304, ...
%t A285694 NestList[Module[{p = NextPrime@ #}, While[PrimeOmega[p - #] != 10, p = NextPrime@ p]; p] &, 2, 28] (* _Michael De Vlieger_, Apr 25 2017 *)
%Y A285694 Cf. A255609, A285688, A285689, A285690, A285691, A285692, A285693.
%K A285694 nonn
%O A285694 1,1
%A A285694 _Zak Seidov_, Apr 25 2017