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!)
A358438 a(1) = 4, a(2) = 6; then a(n + 1) is the smallest semiprime number > a(n) such that the sum of any three consecutive terms is a semiprime. 1

%I #25 Dec 17 2022 05:56:19

%S 4,6,15,25,34,35,46,62,69,74,94,106,119,121,122,134,142,146,158,169,

%T 178,206,213,214,235,249,253,265,267,299,303,319,321,334,382,395,422,

%U 445,446,454,466,469,482,514,517,538,586,589,591,623,629

%N a(1) = 4, a(2) = 6; then a(n + 1) is the smallest semiprime number > a(n) such that the sum of any three consecutive terms is a semiprime.

%C Do even numbers thin out as you look at larger and larger numbers of terms? - _Charles R Greathouse IV_, Nov 18 2022

%H Robert Israel, <a href="/A358438/b358438.txt">Table of n, a(n) for n = 1..10000</a>

%e 4 + 6 + 15 = 25 = 5*5, 6 + 15 + 25 = 46 = 2*23.

%p R:= 4,6:

%p for i from 3 to 100 do

%p s:= R[i-2]+R[i-1];

%p for t from R[i-1]+1 do

%p if numtheory:-bigomega(t) = 2 and numtheory:-bigomega(s+t)=2 then

%p R:= R, t; break

%p fi

%p od od:

%p R; # _Robert Israel_, Nov 18 2022

%t s = {4, 6}; p = 4; q = 6; r = q + 1; Do[While[2 != PrimeOmega[r] || 2 != PrimeOmega[p + q + r], r++]; AppendTo[s, r]; p = q; q = r; r++, {100}]; s

%Y Cf. A062391 (analog for primes), A001358 (semiprimes).

%K nonn

%O 1,1

%A _Zak Seidov_, Nov 17 2022

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 June 11 23:47 EDT 2024. Contains 373319 sequences. (Running on oeis4.)