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 A369139 #10 Jan 14 2024 12:39:16
%S A369139 4,6,8,10,20,22,45,46,50,58,68,76,80,82,92,104,105,106,110,114,117,
%T A369139 152,154,165,166,178,182,186,189,212,226,236,246,258,260,261,262,266,
%U A369139 273,286,290,315,318,322,325,333,338,342,344,345,346,354,357,358,370,382,385,402,406,410,412,424,426
%N A369139 Numbers k such that Omega(k) = 1 + Omega(k + 1).
%C A369139 Numbers k that have one more prime divisor (counted by multiplicity) than k + 1.
%H A369139 Robert Israel, <a href="/A369139/b369139.txt">Table of n, a(n) for n = 1..10000</a>
%e A369139 a(3) = 8 is a term because 8 = 2^3 has 3 prime divisors (counted by multiplicity) and 8 + 1 = 9 = 3^2 has 2.
%p A369139 N:= 1000: # for terms <= N
%p A369139 V:= map(numtheory:-bigomega, [$1..N+1]):
%p A369139 select(t -> V[t] = 1 + V[t+1], [$1..N]);
%t A369139 s = {}; Do[If[PrimeOmega[k] == 1 + PrimeOmega[k + 1], AppendTo[s, k]], {k, 500}]; s
%Y A369139 Cf. A001222, A045920, A076156. Contains A077065.
%K A369139 nonn
%O A369139 1,1
%A A369139 _Zak Seidov_ and _Robert Israel_, Jan 14 2024