cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A367075 a(n) is the least semiprime that is the first of n consecutive semiprimes s(1) ... s(n) such that s(i) - prime(i) are all equal.

This page as a plain text file.
%I A367075 #25 Dec 03 2023 17:04:19
%S A367075 4,9,118,514,1202,9662,46418,198878,273386,717818,717818,270893786,
%T A367075 1009201118,1009201118,68668578806,421210555538,421210555538,
%U A367075 81550619289662,645040014922382,645040014922382,645040014922382
%N A367075 a(n) is the least semiprime that is the first of n consecutive semiprimes s(1) ... s(n) such that s(i) - prime(i) are all equal.
%e A367075 a(3) = 118 because 118, 119, 121 are consecutive semiprimes with 118 - 2 = 119 - 3 = 121 - 5 = 116, and this is the first semiprime that works.
%p A367075 P:= select(isprime, [2,seq(i,i=3..10^6,2)]):
%p A367075 SP:= select(t -> numtheory:-bigomega(t)=2, [$4..10^7]):
%p A367075 nSP:= nops(SP);
%p A367075 t:= 1: k0:= 1: R:= 4: tmax:= 1: d:= 2:
%p A367075 for k from 2 to nSP do
%p A367075   if SP[k]-P[k-k0+1] = d then
%p A367075     t:= t+1;
%p A367075     if t > tmax then R:= R, SP[k0]; tmax:= t; fi;
%p A367075   else
%p A367075     t:= 1; k0:= k; d:= SP[k] - 2;
%p A367075   fi
%p A367075 od:
%p A367075 R;
%Y A367075 All terms are in A001358 and (except for the initial term 4) A070552.
%K A367075 nonn,more
%O A367075 1,1
%A A367075 _Robert Israel_, Nov 05 2023
%E A367075 a(12) from _David A. Corneth_, Nov 05 2023
%E A367075 a(13)-a(15) from _Daniel Suteu_, Nov 18 2023
%E A367075 a(16)-a(18) from _Martin Ehrenstein_, Dec 01 2023
%E A367075 a(19)-a(21) from _Martin Ehrenstein_, Dec 03 2023