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 A024584 #21 Nov 16 2022 14:12:10
%S A024584 7,3,2,1,1,1,1,7,3,2,1,1,1,1,8,3,2,1,1,1,1,8,3,2,1,1,1,1,9,4,2,1,1,1,
%T A024584 1,10,4,2,1,1,1,1,11,4,2,1,1,1,1,12,4,2,1,1,1,1,14,4,2,2,1,1,1,16,4,2,
%U A024584 2,1,1,1,18,5,2,2,1,1,1,22,5,3,2,1,1,1,28,5,3,2,1,1,1,37,5,3,2,1,1,1,56,6
%N A024584 a(n) = floor(1/frac(n*Pi)).
%C A024584 From _Hieronymus Fischer_, Apr 15 2012: (Start)
%C A024584 The sequence is well defined, since frac(n*Pi)>0 for n>0.
%C A024584 Let b(n,m)=|{a(k)| 1<=k<=n, a(k)>=m}| be the number of the first n terms which are >= m >= 1.
%C A024584 Then, lim b(n,m)/n = 1/m for n-->oo since frac(n*pi) is uniformly distributed. (End)
%H A024584 Clark Kimberling, <a href="/A024584/b024584.txt">Table of n, a(n) for n = 1..1000</a>
%t A024584 Table[Floor[1/FractionalPart[n Pi]], {n, 100}] (* _Bruno Berselli_, Apr 15 2012 *)
%o A024584 (PARI) a(n) = floor(1/frac(n*Pi)); \\ _Michel Marcus_, Nov 16 2022
%Y A024584 Cf. A024753, A022844.
%K A024584 nonn
%O A024584 1,1
%A A024584 _Clark Kimberling_