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.

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

This page as a plain text file.
%I A285688 #7 Apr 26 2017 22:56:09
%S A285688 2,29,37,67,79,97,109,127,139,151,163,181,193,211,223,241,269,277,307,
%T A285688 337,349,367,379,397,409,421,433,461,479,487,499,541,569,577,607,619,
%U A285688 631,643,661,673,691,709,727,739,751,769,787,829,857,877,907,919,937,967,997,1009,1021,1033
%N A285688 a(1) = 2; a(n + 1) = smallest prime > a(n) such that a(n + 1) - a(n) is the product of three primes.
%C A285688 First differences: 27,8,30,12,18,12,18,12,12,12,18,12,18,12,18,28,8,30,30,12,18,12
%t A285688 NestList[Module[{p = NextPrime@ #}, While[PrimeOmega[p - #] != 3, p = NextPrime@ p]; p] &, 2, 57] (* _Michael De Vlieger_, Apr 25 2017 *)
%Y A285688 Cf. A255609.
%K A285688 nonn
%O A285688 1,1
%A A285688 _Zak Seidov_, Apr 24 2017