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.
%I A368403 #8 Dec 24 2023 02:42:28
%S A368403 1,2,3,7,11,16,17,18,27,43,47,48,79,97,147,162,171,191,241,242,243,
%T A368403 331,367,387,431,507,547,603,907,1051,1249,1250,1619,1871,2267,2347,
%U A368403 2523,2799,3411,3643,3987,4049,4050,4111,4175,4203,4491,4923,5119,5391,5407,6091
%N A368403 Starts of runs of 3 consecutive integers in A268375.
%C A368403 Analogous to A342029, as A268375 is analogous to A130091.
%H A368403 Amiram Eldar, <a href="/A368403/b368403.txt">Table of n, a(n) for n = 1..10000</a>
%t A368403 f[e_] := Position[Reverse[IntegerDigits[e, 2]], 1] // Flatten; q[n_] := UnsameQ @@ Flatten[f /@ FactorInteger[n][[;; , 2]]]; q[0] = False; seq[kmax_] := Module[{m = 3, s = {}, v}, v = q /@ Range[0, m - 1]; Do[v = Join[Rest[v], {q[k]}]; If[And @@ v, AppendTo[s, k - m + 1]], {k, m, kmax}]; s]; seq[6000]
%o A368403 (PARI) isA268375(n) = {my(e = factor(n)[,2], b = 0); for(i=1, #e, b = bitor(b, e[i])); n == 1 || b == vecsum(e);}
%o A368403 lista(kmax) = {my(tri = vector(3, i, isA268375(i)), k = 4); while(k < kmax, if(vecsum(tri) == 3, print1(k-3, ", ")); tri = concat(vecextract(tri, "^1"), isA268375(k)); k++); }
%Y A368403 Subsequence of A130091, A268375, A342029 and A368402.
%Y A368403 A368404 is a subsequence.
%K A368403 nonn,base
%O A368403 1,2
%A A368403 _Amiram Eldar_, Dec 23 2023