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 A194698 #17 Oct 23 2021 14:07:29
%S A194698 0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%T A194698 1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,
%U A194698 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4
%N A194698 a(n) = floor((n - 1)/12) - floor((n^2 - 1)/(24*n)).
%C A194698 A similar formula for prime indices is mentioned in the abstract of the Folson-Kent-Ono paper (See A194699).
%t A194698 Table[Floor[(n-1)/12]-Floor[(n^2-1)/(24n)],{n,90}] (* _Harvey P. Dale_, Oct 23 2021 *)
%Y A194698 Cf. A000041, A194699.
%K A194698 nonn,easy
%O A194698 1,37
%A A194698 _Omar E. Pol_, Jan 18 2012