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 A077655 #9 Aug 01 2021 11:04:35
%S A077655 0,1,0,0,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,2,1,
%T A077655 0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
%U A077655 0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,2,1,0,0,0,0,0,0,2,1,0,0,0,1,0,0,0,0,0,0,0
%N A077655 Number of consecutive successors of n having the same number of prime factors as n (counted with multiplicity).
%C A077655 If a(n) > 0 then a(n+1) = a(n)-1.
%H A077655 Antti Karttunen, <a href="/A077655/b077655.txt">Table of n, a(n) for n = 1..100000</a>
%e A077655 33=3*11 has only two successors also with two factors: 34=2*17 and 35=5*7 (whereas 33+3=36=2*2*3*3), therefore a(33)=2.
%t A077655 snpf[n_]:=Module[{f=PrimeOmega[n],k=0},While[f==PrimeOmega[n+k],k++];k]; Array[snpf,110]-1 (* _Harvey P. Dale_, Aug 01 2021 *)
%o A077655 (PARI) A077655(n) = { my(k=n+1,w=bigomega(n)); while(bigomega(k)==w,k++); (k-n)-1; }; \\ _Antti Karttunen_, Jan 22 2020
%Y A077655 Cf. A001222, A077656, A045920, A045939, A045940, A045941, A045942, A077657.
%K A077655 nonn
%O A077655 1,33
%A A077655 _Reinhard Zumkeller_, Nov 13 2002