cp's OEIS Frontend

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.

A065802 How small is the squeezed n-gon? Let s0 be the side of a regular n-gon and s1 the side of the maximal n-gon which can be squeezed between the former and its circumcircle. The n-th entry in the sequence is floor(s0/s1).

Original entry on oeis.org

3, 5, 9, 13, 19, 24, 32, 38, 48, 56, 67, 77, 90, 102, 116, 129, 145, 160, 178, 194, 213, 231, 252, 272, 294, 316, 340, 363, 388, 413, 440, 466, 495, 523, 554, 583, 615, 646, 680, 713, 748, 782, 820, 855, 894, 932, 972, 1011, 1053, 1094, 1137, 1180, 1225
Offset: 3

Views

Author

Rainer Rosenthal, Dec 05 2001

Keywords

Comments

Closely related to K(n) = (2*n/Pi)*sin(Pi/n)/(1-cos(Pi/n)) as derived from the n-gon with same circumference as the circle squeezed between the large n-gon and its circumcircle.

Examples

			a(3) = 3 as can be seen in Christmas stars: cos(Pi/3)=1/2, thus a(3) = floor((3/2)/(1/2)) = 3. a(4) = 5 as proposed by Bill Taylor in sci.math: tan(Pi/4)=1, thus a(4) = floor(2*(2/1^2) + 1) = 5.
		

Crossrefs

Cf. A055684.

Programs

  • Maple
    f:= proc(n) if n::odd then floor((1+cos(Pi/n))/(1-cos(Pi/n))) else floor(2*(2/(tan(Pi/n))^2) + 1) fi end proc:
    map(f, [$3..100]); # Robert Israel, Oct 24 2017
  • Mathematica
    f[n_] := If[ OddQ[n], Floor[(1 + Cos[Pi/n]) / (1 - Cos[Pi/n])], Floor[4/(Tan[Pi/n])^2 + 1] ]; Table[ f[n], {n, 3, 60} ]

Formula

For n=odd: a(n) = floor((1+cos(Pi/n))/(1-cos(Pi/n))) For n=even: a(n) = floor( 2*(2/(tan(Pi/n))^2) + 1 )
a(n) = floor(4*n^2/Pi^2) - b(n) where b(n) is in {0,1,2}; 0 occurs only for odd n, while 2 occurs only for even n. - Robert Israel, Oct 24 2017

Extensions

More terms from Robert G. Wilson v, Dec 06 2001