The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A285688 a(1) = 2; a(n + 1) = smallest prime > a(n) such that a(n + 1) - a(n) is the product of three primes. 6

%I #7 Apr 26 2017 22:56:09

%S 2,29,37,67,79,97,109,127,139,151,163,181,193,211,223,241,269,277,307,

%T 337,349,367,379,397,409,421,433,461,479,487,499,541,569,577,607,619,

%U 631,643,661,673,691,709,727,739,751,769,787,829,857,877,907,919,937,967,997,1009,1021,1033

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

%C 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 NestList[Module[{p = NextPrime@ #}, While[PrimeOmega[p - #] != 3, p = NextPrime@ p]; p] &, 2, 57] (* _Michael De Vlieger_, Apr 25 2017 *)

%Y Cf. A255609.

%K nonn

%O 1,1

%A _Zak Seidov_, Apr 24 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 May 14 14:46 EDT 2024. Contains 372533 sequences. (Running on oeis4.)