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!)
A342979 a(1) = 2. For n > 1, a(n) is the smallest prime p > a(n-1) such that a(n-1) + p is a 4-almost prime (A014613). 0
2, 79, 131, 163, 167, 173, 191, 199, 263, 269, 277, 281, 283, 337, 349, 359, 367, 373, 397, 401, 419, 431, 439, 491, 521, 541, 557, 593, 599, 607, 613, 617, 619, 659, 677, 733, 751, 757, 761, 811, 857, 877, 907, 911, 919, 1009, 1021, 1039, 1051, 1097, 1129, 1163, 1181, 1237, 1279 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Minimal difference 2 occurs at positions 12, 32, 86, 118, 155, 242, 345, 427, 430, 517, .... E.g., 2 = 283 - 281 = 619 - 617 = 2083 - 2081.
LINKS
EXAMPLE
2 + 79 = 81 = A014613(8), 79 + 131 = 210 = A014613(27).
MATHEMATICA
s = {2}; p = 2; Do[q = NextPrime[p]; While[4 != PrimeOmega[p + q], q = NextPrime[q]]; AppendTo[s, p = q], {55}]; s
CROSSREFS
Sequence in context: A231240 A197101 A245674 * A166052 A045484 A113152
KEYWORD
nonn
AUTHOR
Zak Seidov, Apr 02 2021
STATUS
approved

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 23 10:29 EDT 2024. Contains 371905 sequences. (Running on oeis4.)