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.

A366673 a(n) is the least triprime k such that k + n is the next triprime after k.

This page as a plain text file.
%I A366673 #11 Mar 14 2024 15:21:43
%S A366673 27,18,63,8,45,12,20,130,138,154,52,30,561,78,1194,1930,4277,292,5343,
%T A366673 26353,4255,7847,34773,18628,71718,72308,168114,64699,43209,227451,
%U A366673 239643,17641,97061,162124,924718,930311,488001,7248711,2986751,704908,4108654,7220012
%N A366673 a(n) is the least triprime k such that k + n is the next triprime after k.
%H A366673 Martin Raab, <a href="/A366673/b366673.txt">Table of n, a(n) for n = 1..83</a>
%e A366673 a(3) = 63 because 63 = 3^2 * 7 is a triprime and the next triprime is 63 + 3 = 66 = 2 * 3 * 11.
%p A366673 T:= select(t -> numtheory:-bigomega(t) = 3, [$1..10^7]):
%p A366673 dT:= T[2..-1]-T[1..-2]:
%p A366673 V:= Vector(42):
%p A366673 for i from 1 to nops(dT) do
%p A366673   if dT[i] <= 42 and V[dT[i]] = 0 then V[dT[i]]:= T[i] fi
%p A366673 od:
%p A366673 convert(V,list);
%Y A366673 Cf. A014612, A131109.
%K A366673 nonn
%O A366673 1,1
%A A366673 _Zak Seidov_ and _Robert Israel_, Oct 16 2023