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.

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

This page as a plain text file.
%I A285693 #11 Apr 26 2017 22:55:04
%S A285693 2,6563,6947,7331,7907,8291,8867,10163,10739,11699,12659,13043,13619,
%T A285693 15731,16691,17987,18371,18947,19843,20483,21059,23003,23899,24763,
%U A285693 25147,26107,26683,27067,28027,28283,28859,29243,29819
%N A285693 a(1) = 2; a(n + 1) = smallest prime > a(n) such that a(n + 1) - a(n) is the product of 8 primes.
%C A285693 First differences: 6561, 384, 384, 576, 384, 576, 1296, 576, 960, 960, 384, 576, 2112,...
%t A285693 NestList[Module[{p = NextPrime@ #}, While[PrimeOmega[p - #] != 8, p = NextPrime@ p]; p] &, 2, 32] (* _Michael De Vlieger_, Apr 25 2017 *)
%Y A285693 Cf. A255609, A285688, A285689, A285690, A285691, A285692.
%K A285693 nonn
%O A285693 1,1
%A A285693 _Zak Seidov_, Apr 25 2017