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 A073484 #11 Apr 10 2021 05:53:33
%S A073484 0,0,0,0,0,0,1,0,0,1,0,0,0,1,1,0,1,0,0,0,1,1,0,0,1,1,0,1,0,1,0,1,0,1,
%T A073484 1,1,0,0,1,1,1,0,1,1,0,0,1,0,1,0,1,0,1,1,1,0,1,1,1,1,0,0,1,0,0,1,0,0,
%U A073484 2,1,0,1,1,1,1,1,1,0,1,2,0,1,1,0,1,0,1,1,0,1,1,0,0,1,1,0,1,1,1,0,1,1,0,2,0
%N A073484 Number of gaps in factors of the n-th squarefree number.
%H A073484 Amiram Eldar, <a href="/A073484/b073484.txt">Table of n, a(n) for n = 1..10000</a>
%F A073484 a(A000040(n))=0; a(A006094(n))=0; a(A002110(n))=0; a(A073485(n))=0.
%F A073484 a(A073486(n))>0; a(A073487(n))=1; a(A073488(n))=2; a(A073489(n))=3.
%F A073484 a(n)=0 iff A073483(n)=1.
%e A073484 The 69th squarefree number is 110=2*5*11, therefore a(69)=2, as there are two gaps: between 2 and 5 and between 5 and 11.
%t A073484 gaps[n_] := SequenceCount[FactorInteger[n][[;; , 1]], {p1_, p2_} /; p2 != NextPrime[p1], Overlaps -> True]; gaps /@ Select[Range[200], SquareFreeQ] (* _Amiram Eldar_, Apr 10 2021 *)
%Y A073484 Cf. A005117, A073483.
%K A073484 nonn
%O A073484 1,69
%A A073484 _Reinhard Zumkeller_, Aug 03 2002