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 A068796 #15 Nov 12 2015 06:04:54
%S A068796 2,1,2,2,2,3,3,2,1,3,2,3,2,1,4,3,2,2,3,2,1,3,3,2,1,2,1,2,2,4,3,2,1,1,
%T A068796 3,3,2,1,4,3,2,2,2,1,4,3,4,3,2,2,4,4,3,2,2,2,1,3,2,5,4,3,3,4,3,2,3,2,
%U A068796 4,3,2,4,3,2,1,2,5,5,4,4,3,3,3,2,1,1,3,2,4,3,2,2,1,1,4,3,2,1,3,3,2,3,4
%N A068796 Maximum k such that k consecutive integers starting at n have distinct numbers of prime factors (counted with multiplicity).
%C A068796 The number of prime factors (counted with multiplicity) of n is bigomega(n) = A001222(n).
%H A068796 Zak Seidov, <a href="/A068796/b068796.txt">Table of n, a(n) for n = 1..10000</a>
%e A068796 a(6)=3 because 6, 7, 8 and 9 have, respectively, 2, 1, 3 and 2 prime factors; the first 3 of these are distinct.
%t A068796 bigomega[n_] := Plus@@Last/@FactorInteger[n]; a[n_] := For[k=1; s={bigomega[n]}, True, k++, If[MemberQ[s, z=bigomega[n+k]], Return[k], AppendTo[s, z]]]
%t A068796 ss={}; Do[s={PrimeOmega[n]};k=1;While[FreeQ[s, (b=PrimeOmega[n+k])],s=AppendTo[s,b];k++];ss=AppendTo[ss,k],{n,103}]; (* _Zak Seidov_, Nov 09 2015 *)
%Y A068796 Cf. A001222, A067665, A068797.
%K A068796 nonn
%O A068796 1,1
%A A068796 _Dean Hickerson_, Mar 05 2002