login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A285693 a(1) = 2; a(n + 1) = smallest prime > a(n) such that a(n + 1) - a(n) is the product of 8 primes. 1

%I #11 Apr 26 2017 22:55:04

%S 2,6563,6947,7331,7907,8291,8867,10163,10739,11699,12659,13043,13619,

%T 15731,16691,17987,18371,18947,19843,20483,21059,23003,23899,24763,

%U 25147,26107,26683,27067,28027,28283,28859,29243,29819

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

%C First differences: 6561, 384, 384, 576, 384, 576, 1296, 576, 960, 960, 384, 576, 2112,...

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

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

%K nonn

%O 1,1

%A _Zak Seidov_, Apr 25 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)