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 A376066 #22 Sep 17 2024 22:43:25 %S A376066 4,9,14,18,23,27,32,36,40,45,49,54,58,63,67,72,76,80,85,89,94,98,103, %T A376066 107,112,116,120,125,129,134,138,143,147,152,156,160,165,169,174,178, %U A376066 183,187,192,196,200,205,209,214,218,223,227,232,236,240,245,249,254,258,263,267,272,276,280,285,289,294,298,303,307,311 %N A376066 Minimum number of unit squares needed to cover the circumference of a circle of radius n. %C A376066 For n>=2, a unit square covers the most circumference when it has two diagonally opposite corners on the circumference, forming a chord of length sqrt(2). %C A376066 A simple upper bound a(n) <= u(n) = ceiling(2*Pi*n/sqrt(2)) would be by sqrt(2) arcs instead of chords, and which is bigger at for instance a(70) = 311 < u(70) = 312 (see A376207). %F A376066 a(n) = ceiling(Pi/arcsin(sqrt(2)/(2*n))). %Y A376066 Cf. A376207. %K A376066 easy,nonn %O A376066 1,1 %A A376066 _Maurice Clerc_, Sep 08 2024