The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A263349 a(n) = smallest number > a(n-1) such that a(n-1) + a(n) is a semiprime (A001358), a(1)=1. 0
 1, 3, 6, 8, 13, 20, 26, 29, 33, 36, 38, 39, 43, 44, 47, 48, 58, 60, 61, 62, 67, 74, 81, 85, 92, 93, 94, 100, 101, 102, 103, 106, 107, 108, 109, 110, 111, 115, 120, 127, 132, 133, 134, 140, 147, 148, 150, 151, 152, 153, 156, 158, 161, 162, 164, 165 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Similar sequences with any other initial a(1) will eventually merge with case a(1)=1. LINKS EXAMPLE 1 + 3 = 4 = 2*2, 3 + 6 = 9 = 3*3, 6 + 8 = 14 = 2*7, etc. MATHEMATICA s={a=1}; Do[k=a+1; While[PrimeOmega[a+k]!=2, k++]; AppendTo[s, a=k], {100}]; s PROG (PARI) lista(nn) = {print1(a = 1, ", "); for (k=1, nn, na = a+1; while (bigomega(a+na) != 2, na++); a = na; print1(a, ", "); ); } \\ Michel Marcus, Oct 17 2015 CROSSREFS Cf. A001358, A243625. Sequence in context: A073355 A067440 A108161 * A297211 A274605 A213983 Adjacent sequences:  A263346 A263347 A263348 * A263350 A263351 A263352 KEYWORD nonn AUTHOR Zak Seidov, Oct 15 2015 STATUS approved

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

Last modified February 26 00:08 EST 2020. Contains 332270 sequences. (Running on oeis4.)