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 A032615 #27 Dec 23 2024 14:53:41
%S A032615 0,0,0,0,1,1,1,2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,10,
%T A032615 10,10,11,11,11,12,12,12,13,13,13,14,14,14,14,15,15,15,16,16,16,17,17,
%U A032615 17,18,18,18,19,19,19,20,20,20,21,21,21,21,22,22,22,23,23,23,24
%N A032615 a(n) = floor(n/Pi).
%C A032615 a(n) = A062300(n-1) = floor(1/sin(Pi/n)) for almost all indices, the next exception after n = 6 being n = 80143857, cf. link to Kevin Ryde's post to the SeqFan list. - _M. F. Hasler_, Oct 20 2016
%H A032615 R. Israel, in reply to K. Ryde, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2016-October/016857.html">Re: nearly equal floor(n/Pi) A032615 and A062300</a>, SeqFan list, Oct 19 2016.
%H A032615 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%p A032615 A032615:=n->floor(n/Pi); seq(A032615(n), n=0..100); # _Wesley Ivan Hurt_, Dec 10 2013
%t A032615 Table[Floor[n/Pi], {n, 0, 100}] (* _Wesley Ivan Hurt_, Dec 10 2013 *)
%o A032615 (PARI) a(n)=n\Pi \\ _Charles R Greathouse IV_, Dec 10 2013
%Y A032615 Cf. A062300. Beatty seq. of A049541.
%K A032615 nonn,easy
%O A032615 0,8
%A A032615 _Patrick De Geest_, May 15 1998