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 A343461 #22 Mar 18 2025 07:28:16
%S A343461 6,4,3,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%T A343461 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%U A343461 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2
%N A343461 a(n) is the maximal number of regular n-gons that can be arranged around a vertex without overlapping.
%C A343461 As n increases, the internal angle of the regular n-gon tends towards 180 degrees, so a(n) = 2 for n > 6.
%C A343461 This also shows that no regular n-gon can tile the plane for n > 6 since in any tiling by convex tiles at least three tiles meet at every vertex.
%H A343461 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%F A343461 a(n) = floor(2*n/(n-2)).
%e A343461 For n = 5: arranging 3 regular pentagons around a vertex leaves a gap smaller than the internal angle of a regular pentagon, so a(5) = 3.
%t A343461 Table[Floor[2 n/(n - 2)], {n, 3, 100}] (* _Wesley Ivan Hurt_, Apr 19 2021 *)
%o A343461 (PARI) a(n) = floor(n*(2/(n-2)))
%o A343461 (Magma) [Floor(2*n/(n-2)) : n in [3..100]]; // _Wesley Ivan Hurt_, Apr 19 2021
%Y A343461 Cf. A071279.
%K A343461 nonn,easy
%O A343461 3,1
%A A343461 _Felix Fröhlich_, Apr 16 2021
%E A343461 Edited by _Peter Munn_, Mar 18 2025