A228787 -id:A228787 - cp's OEIS frontend

A003401 Numbers of edges of regular polygons constructible with ruler (or, more precisely, an unmarked straightedge) and compass.

1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 32, 34, 40, 48, 51, 60, 64, 68, 80, 85, 96, 102, 120, 128, 136, 160, 170, 192, 204, 240, 255, 256, 257, 272, 320, 340, 384, 408, 480, 510, 512, 514, 544, 640, 680, 768, 771, 816, 960, 1020, 1024, 1028, 1088, 1280, 1285

Offset: 1

N. J. A. Sloane, R. K. Guy

The terms 1 and 2 correspond to degenerate polygons.
These are also the numbers for which phi(n) is a power of 2: A209229(A000010(a(n))) = 1. - Olivier Gérard Feb 15 1999
From Stanislav Sykora, May 02 2016: (Start)
The sequence can be also defined as follows: (i) 1 is a member. (ii) Double of any member is also a member. (iii) If a member is not divisible by a Fermat prime F_k then its product with F_k is also a member. In particular, the powers of 2 (A000079) are a subset and so are the Fermat primes (A019434), which are the only odd prime members.
The definition is too restrictive (though correct): The Georg Mohr - Lorenzo Mascheroni theorem shows that constructibility using a straightedge and a compass is equivalent to using compass only. Moreover, Jean Victor Poncelet has shown that it is also equivalent to using straightedge and a fixed ('rusty') compass. With the work of Jakob Steiner, this became part of the Poncelet-Steiner theorem establishing the equivalence to using straightedge and a fixed circle (with a known center). A further extension by Francesco Severi replaced the availability of a circle with that of a fixed arc, no matter how small (but still with a known center).
Constructibility implies that when m is a member of this sequence, the edge length 2*sin(Pi/m) of an m-gon with circumradius 1 can be written as a finite expression involving only integer numbers, the four basic arithmetic operations, and the square root. (End)
If x,y are terms, and gcd(x,y) is a power of 2 then x*y is also a term. - David James Sycamore, Aug 24 2024

			34 is a term of this sequence because a circle can be divided into exactly 34 parts. 7 is not.

Albert H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 183.
Allan Clark, Elements of Abstract Algebra, Chapter 4, Galois Theory, Dover Publications, NY 1984, page 124.
Duane W. DeTemple, "Carlyle circles and the Lemoine simplicity of polygon constructions." The American Mathematical Monthly 98.2 (1991): 97-108. - N. J. A. Sloane, Aug 05 2021
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
B. L. van der Waerden, Modern Algebra. Unger, NY, 2nd ed., Vols. 1-2, 1953, Vol. 1, p. 187.

Amiram Eldar, Table of n, a(n) for n = 1..10136 (terms below 10^100; terms 1..2000 from T. D. Noe)
Laura Anderson, Jasbir S. Chahal and Jaap Top, The last chapter of the Disquisitiones of Gauss, arXiv:2110.01355 [math.HO], 2021.
Wayne Bishop, How to construct a regular polygon, Amer. Math. Monthly 85(3) (1978), 186-188.
Alessandro Chiodo, A note on the construction of the Śrī Yantra, Sorbonne Université (Paris, France, 2020).
T. Chomette, Construction des polygones réguliers (in French).
Duane W. DeTemple, Carlyle circles and the Lemoine simplicity of polygon constructions, Amer. Math. Monthly 98(2) (1991), 97-108.
Bruce Director, Measurement and Divisibility.
David Eisenbud and Brady Haran, Heptadecagon and Fermat Primes (the math bit), Numberphile video (2015).
Mauro Fiorentini, Construibili (numeri).
C. F. Gauss, Disquisitiones Arithmeticae, 1801. English translation: Yale University Press, New Haven, CT, 1966, p. 463. Original (in Latin).
Richard K. Guy, The Second Strong Law of Small Numbers, Math. Mag. 63(1) (1990), 3-20. [Annotated scanned copy] [DOI]
Richard K. Guy and N. J. A. Sloane, Correspondence, 1988.
Johann Gustav Hermes, Über die Teilung des Kreises in 65537 gleiche Teile (About the division of the circle into 65537 equal pieces), Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse, Vol. 3 (1894), 170-186.
Friedrich Julius Richelot, De resolutione algebraica aequationis X^257 = 1, sive de divisione circuli per bisectionem anguli septies repetitam in partes 257 inter se aequales commentatio coronata (On the resolution of the algebraic equation X^257 = 1, or ...), Journal für die reine und angewandte Mathematik 9 (1832), 1-26.
Pierre Wantzel, Recherches sur les moyens de reconnaître si un Problème de Géométrie peut se résoudre avec la règle et le compas (Investigations into means of knowing if a problem of geometry can be solved with a straightedge and compass), Journal de Mathématiques Pures et Appliquées 2 (1837), 366-372.
Eric Weisstein's World of Mathematics, Constructible Number.
Eric Weisstein's World of Mathematics, Constructible Polygon.
Eric Weisstein's World of Mathematics, Regular Polygon.
Eric Weisstein's World of Mathematics, Trigonometry.
Eric Weisstein's World of Mathematics, Trigonometry Angles.
Wikipedia, Constructible polygon.
Wikipedia, Johann Gustav Hermes.
Wikipedia, Friedrich Julius Richelot.
Wikipedia, Mohr-Mascheroni theorem.
Wikipedia, Pierre Wantzel.
Wikipedia, Poncelet-Steiner theorem.
Robert G. Wilson v, Letter to N. J. A. Sloane, Aug. 1993.

Subsequence of A295298. - Antti Karttunen, Nov 27 2017
A004729 and A051916 are subsequences. - Reinhard Zumkeller, Mar 20 2010
Cf. A000079, A004169, A000215, A099884, A019434 (Fermat primes).
Edge lengths of other constructible m-gons: A002194 (m=3), A002193 (4), A182007 (5), A101464 (8), A094214 (10), A101263 (12), A272534 (15), A272535 (16), A228787 (17), A272536 (20).
Positions of zeros in A293516 (apart from two initial -1's), and in A336469, positions of ones in A295660 and in A336477 (characteristic function).
Cf. also A046528.
Cf. A000079, A092506.

a003401 n = a003401_list !! (n-1)
a003401_list = map (+ 1) $ elemIndices 1 $ map a209229 a000010_list
-- Reinhard Zumkeller, Jul 31 2012

Select[ Range[ 1300 ], IntegerQ[ Log[ 2, EulerPhi[ # ] ] ]& ] (* Olivier Gérard Feb 15 1999 *)
(* first do *) Needs["DiscreteMath`Combinatorica`"] (* then *) Take[ Union[ Flatten[ NestList[2# &, Times @@@ Table[ UnrankSubset[n, Join[{1}, Table[2^2^i + 1, {i, 0, 4}]]], {n, 63}], 11]]], 60] (* Robert G. Wilson v, Jun 11 2005 *)
nn=10; logs=Log[2,{2,3,5,17,257,65537}]; lim2=Floor[nn/logs[[1]]]; Sort[Reap[Do[z={i,j,k,l,m,n}.logs; If[z<=nn, Sow[2^z]], {i,0,lim2}, {j,0,1}, {k,0,1}, {l,0,1}, {m,0,1}, {n,0,1}]][[2,1]]]
A092506 = {2, 3, 5, 17, 257, 65537}; s = Sort[Times @@@ Subsets@ A092506]; mx = 1300; Union@ Flatten@ Table[(2^n)*s[[i]], {i, 64}, {n, 0, Log2[mx/s[[i]]]}] (* Robert G. Wilson v, Jul 28 2014 *)

for(n=1,10^4,my(t=eulerphi(n));if(t/2^valuation(t,2)==1,print1(n,", "))); \\ Joerg Arndt, Jul 29 2014

is(n)=n>>=valuation(n,2); if(n<7, return(n>0)); my(k=logint(logint(n,2),2)); if(k>32, my(p=2^2^k+1); if(n%p, return(0)); n/=p; unknown=1; if(n%p==0, return(0)); p=0; if(is(n)==0, 0, "unknown [has large Fermat number in factorization]"), 4294967295%n==0) \\ Charles R Greathouse IV, Jan 09 2022

is(n)=n>>=valuation(n,2); 4294967295%n==0 \\ valid for n <= 2^2^33, conjecturally valid for all n; Charles R Greathouse IV, Jan 09 2022

from sympy import totient
A003401_list = [n for n in range(1,10**4) if format(totient(n),'b').count('1') == 1]
# Chai Wah Wu, Jan 12 2015

Terms from 3 onward are computable as numbers such that cototient-of-totient equals the totient-of-totient: Flatten[Position[Table[co[eu[n]]-eu[eu[n]], {n, 1, 10000}], 0]] eu[m]=EulerPhi[m], co[m]=m-eu[m]. - Labos Elemer, Oct 19 2001, clarified by Antti Karttunen, Nov 27 2017
Any product of 2^k and distinct Fermat primes (primes of the form 2^(2^m)+1). - Sergio Pimentel, Apr 30 2004, edited by Franklin T. Adams-Watters, Jun 16 2006
If the well-known conjecture that there are only five prime Fermat numbers F_k=2^{2^k}+1, k=0,1,2,3,4 is true, then we have exactly: Sum_{n>=1} 1/a(n)= 2*Product_{k=0..4} (1+1/F_k) = 4869735552/1431655765 = 3.40147098978.... - Vladimir Shevelev and T. D. Noe, Dec 01 2010
log a(n) >> sqrt(n); if there are finitely many Fermat primes, then log a(n) ~ k log n for some k. - Charles R Greathouse IV, Oct 23 2015

Definition clarified by Bill Gosper. - N. J. A. Sloane, Jun 14 2020

A272534 Decimal expansion of the edge length of a regular 15-gon with unit circumradius.

Original entry on oeis.org

4, 1, 5, 8, 2, 3, 3, 8, 1, 6, 3, 5, 5, 1, 8, 6, 7, 4, 2, 0, 3, 4, 8, 4, 5, 6, 8, 8, 1, 0, 2, 5, 0, 3, 3, 2, 4, 3, 3, 1, 6, 9, 5, 2, 1, 2, 5, 5, 4, 4, 7, 6, 7, 2, 8, 1, 4, 3, 6, 3, 9, 4, 7, 7, 6, 4, 7, 6, 5, 6, 5, 1, 3, 2, 8, 1, 4, 8, 7, 5, 2, 6, 0, 9, 2, 5, 7, 5, 1, 3, 4, 4, 5, 4, 5, 5, 1, 4, 6, 1, 1, 5, 7, 3, 0

Offset: 0

Stanislav Sykora, May 02 2016

15-gon is the first m-gon with odd composite m which is constructible (see A003401) in virtue of the fact that 15 is the product of two distinct Fermat primes (A019434). The next such case is 51-gon (m=3*17), followed by 85-gon (m=5*17), 771-gon (m=3*257), etc.
From Wolfdieter Lang, Apr 29 2018: (Start)
This constant appears in a historic problem posed by Adriaan van Roomen (Adrianus Romanus) in his Ideae mathematicae from 1593, solved by Viète. See the Havil reference, problem 4, pp. 69-74. See also the comments in A302711 with a link to Romanus' book, Exemplum quaesitum.
This problem is equivalent to R(45, 2*sin(Pi/675)) = 2*sin(Pi/15), with a special case of monic Chebyshev polynomials of the first kind, named R, given in A127672. For the constant 2*sin(Pi/675) see A302716. (End)

			0.415823381635518674203484568810250332433169521255447672814363947...

Julian Havil, The Irrationals, A Story of the Numbers You Can't Count On, Princeton University Press, Princeton and Oxford, 2012, pp. 69-74.

Stanislav Sykora, Table of n, a(n) for n = 0..2000
Mauro Fiorentini, Construibili (numeri)
Eric Weisstein's World of Mathematics, Constructible Number
Wikipedia, Constructible number
Wikipedia, Regular polygon
Index entries for sequences related to Chebyshev polynomials.
Index entries for algebraic numbers, degree 8.

Cf. A003401, A019434, A127672, A302711, A302716.

Edge lengths of other constructible m-gons: A002194 (m=3), A002193 (4), A182007 (5), A101464 (8), A094214 (10), A101263 (12), A272535 (16), A228787 (17), A272536 (20).

RealDigits[N[2Sin[Pi/15], 100]][[1]] (* Robert Price, May 02 2016*)

PARI
```
2*sin(Pi/15)
```

Equals 2*sin(Pi/m) for m=15, 2*A019821.
Also equals (sqrt(3) - sqrt(15) + sqrt(10 + 2*sqrt(5)))/4.
Also equals sqrt(7 - sqrt(5) - sqrt(30 - 6*sqrt(5)))/2. This is the rewritten expression of the Havil reference on top of p. 70. - Wolfdieter Lang, Apr 29 2018

A228785 Table of coefficients of the algebraic number s(2l+1) = 2sin(Pi/(2l+1)) as a polynomial in odd powers of rho(2(2l+1)) = 2cos(Pi/(2(2l+1))) (reduced version).

Original entry on oeis.org

1, -3, 1, 5, -5, 1, -4, 5, -1, 9, -30, 27, -9, 1, -11, 55, -77, 44, -11, 1, 4, -13, 7, -1, -15, 140, -378, 450, -275, 90, -15, 1, 17, -204, 714, -1122, 935, -442, 119, -17, 1, -4, 25, -26, 9, -1, 0, 21, -385, 2079, -5148, 7007, -5733, 2940, -952, 189, -21, 1, -8, 126, -539, 967, -870, 429, -118, 17, -1, 0

Offset: 1

Wolfdieter Lang, Oct 07 2013

In the regular (2*l+1)-gon, l >= 1, inscribed in a circle of radius R the length ratio side/R is s(2*l+1) = 2*sin(Pi/(2*l+1)). This can be written as a polynomial in the length ratio (smallest diagonal)/side in the (2*(2*l+1))-gon given by rho(2*(2*l+1)) = 2*cos(Pi/(2*(2*l+1))). This leads, in a first step, to the signed triangle A111125. Because of the minimal polynomial of the algebraic number rho(2*(2*l+1)) of degree delta(2*(2*l+1)) = A055034(2*(2*l+1)), called C(2*(2*l+1),x) (with coefficients given in A187360), one can eliminate all powers rho(2*(2*l+1))^k with k >= delta(2*(2*l+1)) by using C(2*(2*l+1),rho(2*(2*l+1))) = 0. This leads to the present table expressing s(2*(l+1)) in terms of odd powers of rho(2*(2*l+1)) with maximal exponent delta(2*(2*l+1))-1.
This table gives the coefficients of s(2*l+1), related to the (2*l+1)-gon, in the power basis of the algebraic number field Q(rho(2*(2*l+1))) of degree delta(2*(2*l+1)), related to rho from the (2*(2*l+1))-gon, provided one inserts zeros for the even powers, starting each row with a zero and filling zeros at the end in order to obtain the row length delta(2*(2*l+1)). Note that some trailing zeros in the present table (e.g., row l = 10) have been given such that the row length for the s(2*l+1) coefficients in the power basis Q(rho(2*(2*l+1))) becomes just twice the one of this table.
Thanks go to Seppo Mustonen for telling me about his findings regarding the square of the sum of all length in the regular n-gon, which led me to consider this entry (even though for odd n this is not needed because only s(2*l+1)^2  = 4 - rho(2*l+1)^2 enters).

			The table a(l,m), with n = 2*l+1, begins:
n,   l \m  0    1     2     3    4     5    6    7   8   9 10
3,   1:    1
5,   2:   -3    1
7,   3:    5   -5     1
9,   4:   -4    5    -1
11,  5:    9  -30    27    -9    1
13,  6:  -11   55   -77    44  -11     1
15,  7:    4  -13     7    -1
17,  8:  -15  140  -378   450 -275    90  -15    1
19,  9:   17 -204   714 -1122  935  -442  119  -17   1
21, 10:   -4   25   -26     9   -1     0
23, 11:   21 -385  2079 -5148 7007 -5733 2940 -952 189 -21  1
25, 12:   -8  126  -539   967 -870   429 -118   17  -1   0
27, 13:    4  -41    70   -43   11    -1    0    0   0
...
n = 29 l =  14:  -27, 819, -7371, 30888, -72930, 107406, -104652, 69768, -32319, 10395, -2277, 324, -27, 1.
n = 5, l=2: s(5) = -3*rho(10) + rho(10)^3 = (tau - 1)*sqrt(2 + tau), approximately 1.175570504, where tau = (1 + sqrt(5))/2 (golden section).
n = 17, l = 8: s(17) = -15*x + 140*x^3 - 378*x^5 + 450*x^7 - 275*x^9 + 90*x^11 - 15*x^13 + 1*x^15, with x = rho(34) = 2*cos(Pi/34). s(17) is approximately 0.3674990356. With the length row l = 8 the degree of the algebraic number s(17) = 2*sin(Pi/17) is therefore 2*8 = 16. See A228787 for the decimal expansion of s(17) and A228788 for the one of rho(34).

Cf. A055034, A187360, A228783 (even n case), A228786 (minimal polynomials).

Cf. A140882, A267633.

a(l,m) = [x^(2*m+1)](s(2*l+1,x)(mod C(2*(2l+1),x))), with s(2*l+1,x) = sum((-1)^(l-1-s)* A111125(l1,s)*x^(2*s+1), s=0..l-1), l >= 1, m=0, ..., (delta(2*(2*l+1))/2 - 1), with delta(n) = A055034(n).

Rows 9,15,21,27 are coefficients of polynomials in reciprocal powers of u for rows n=2,4,6,8 generated by the o.g.f. (u-4)/(u-ux+x^2) of A267633. These polynomials in u occur in a moving average of the polynomials of A140882 interlaced with these polynomials. - Tom Copeland, Jan 16 2016

A272535 Decimal expansion of the edge length of a regular 16-gon with unit circumradius.

Original entry on oeis.org

3, 9, 0, 1, 8, 0, 6, 4, 4, 0, 3, 2, 2, 5, 6, 5, 3, 5, 6, 9, 6, 5, 6, 9, 7, 3, 6, 9, 5, 4, 0, 4, 4, 4, 8, 1, 8, 5, 5, 3, 8, 3, 2, 3, 5, 5, 0, 3, 9, 0, 9, 6, 1, 5, 5, 0, 9, 0, 0, 4, 1, 7, 8, 9, 8, 9, 5, 2, 6, 6, 3, 7, 5, 7, 1, 8, 4, 9, 1, 6, 0, 4, 5, 0, 6, 5, 0, 6, 1, 8, 4, 6, 8, 1, 8, 0, 7, 6, 3, 4, 6, 1, 9, 8, 4

Offset: 0

Stanislav Sykora, May 02 2016

Like all m-gons with m equal to a power of 2 (see A003401 and A000079), this is a constructible number.

			0.390180644032256535696569736954044481855383235503909615509004...

Stanislav Sykora, Table of n, a(n) for n = 0..2000
Mauro Fiorentini, Construibili (numeri)
Eric Weisstein's World of Mathematics, Constructible Number
Wikipedia, Constructible number
Wikipedia, Regular polygon
Index entries for algebraic numbers, degree 8.

Cf. A000079, A003401.

Edge lengths of other constructible m-gons: A002194 (m=3), A002193 (4), A182007 (5), A101464 (8), A094214 (10), A101263 (12), A272534 (15), A228787 (17), A272536 (20).

RealDigits[N[2Sin[Pi/16], 100]][[1]] (* Robert Price, May 02 2016*)

PARI
```
2*sin(Pi/16)
```

Equals 2*sin(Pi/m) for m=16, 2*A232738. Equals also sqrt(2-sqrt(2+sqrt(2))).

A272536 Decimal expansion of the edge length of a regular 20-gon with unit circumradius.

Original entry on oeis.org

3, 1, 2, 8, 6, 8, 9, 3, 0, 0, 8, 0, 4, 6, 1, 7, 3, 8, 0, 2, 0, 2, 1, 0, 6, 3, 8, 9, 3, 4, 3, 3, 3, 7, 8, 4, 6, 2, 7, 7, 9, 9, 7, 8, 4, 1, 7, 1, 3, 2, 1, 5, 8, 0, 1, 6, 9, 2, 8, 2, 6, 9, 2, 1, 1, 5, 5, 1, 7, 5, 8, 6, 6, 1, 1, 2, 4, 7, 1, 5, 8, 6, 7, 3, 3, 9, 1, 7, 4, 5, 3, 5, 3, 6, 9, 7, 3, 7, 6, 7, 5, 0, 2, 8, 0

Offset: 0

Stanislav Sykora, May 02 2016

Since 20-gon is constructible (see A003401), this is a constructible number.

			0.3128689300804617380202106389343337846277997841713215801692826921...

Stanislav Sykora, Table of n, a(n) for n = 0..2000
Mauro Fiorentini, Construibili (numeri)
Eric Weisstein's World of Mathematics, Constructible Number
Wikipedia, Constructible number
Wikipedia, Regular polygon
Index entries for algebraic numbers, degree 8.

Cf. A003401.
Edge lengths of other constructible m-gons: A002194 (m=3), A002193 (4), A182007 (5), A101464 (8), A094214 (10), A101263 (12), A272534 (15), A272535 (16), A228787 (17).
Cf. A019818.

RealDigits[N[2Sin[Pi/20], 100]][[1]] (* Robert Price, May 02 2016*)

PARI
```
2*sin(Pi/20)
```

Equals 2*sin(Pi/20) = 2*A019818.
Equals also (sqrt(2)+sqrt(10)-2*sqrt(5-sqrt(5)))/4.
Equals i^(9/10) + i^(-9/10). - Gary W. Adamson, Jul 08 2022

A228788 Decimal expansion of the algebraic integer 2*cos(Pi/34) of degree 16 = A055034(34) (over the rationals), the length ratio (smallest diagonal)/side of a regular 34-gon.

Original entry on oeis.org

1, 9, 9, 1, 4, 6, 8, 3, 5, 2, 5, 9, 0, 0, 6, 9, 0, 4, 3, 7, 4, 2, 3, 8, 2, 3, 5, 7, 8, 1, 0, 9, 6, 3, 5, 6, 7, 8, 0, 5, 4, 4, 9, 2, 3, 5, 2, 3, 2, 5, 9, 8, 3, 9, 6, 7, 4, 3, 8, 0, 6, 0, 3, 2, 6, 1, 7, 4, 1, 4, 3, 1, 8, 8, 3, 5, 7, 0, 6, 8, 1, 6, 0, 7, 5, 0, 9, 6, 8, 4, 9, 4, 7, 4, 0, 2, 5, 9, 6, 8, 3, 4, 0, 9

Offset: 1

Wolfdieter Lang, Oct 07 2013

rho(34):= 2*cos(Pi/34) is used in the algebraic number field Q(rho(34)) of degree 16 (see A187360) in which s(17) = 2*cos(Pi/17) (for its decimal expansion see A228787), the length ratio side/R of a regular 17-gon inscribed in a circle of radius R, is an integer. See A228787 for this expansion.
Gauss' formula for cos(2*Pi/17), given in A210644, can be inserted into rho(34) = sqrt(2+sqrt(2+2*cos(2*Pi/17))).
The minimal polynomial of rho(34) is 17 - 204*x^2 + 714*x^4 - 1122*x^6 + 935*x^8 - 442*x^10 + 119*x^12 - 17*x^14 + x^16 (row n=34 polynomial of A187360).
The continued fraction expansion starts with 1; 1, 116, 4, 1, 2, 1, 20, 2, 2, 1, 7, 10, 2, 2, 1, 3, 6, 1, 4, 4, 15, ...

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Kival Ngaokrajang, Illustration of the length ratio (smallest diagonal)/side of a regular 34-gon

Cf. A055034, A187360, A210644, A228787.

RealDigits[2 Cos[Pi/34], 10, 111][[1]] (* Robert G. Wilson v, Jul 28 2014 *)

2*cos(Pi/34) \\ Charles R Greathouse IV, Nov 12 2014

2*cos(Pi/34) = 1.99146835259006904374238235781096...

A370393 Decimal expansion of the area of a unit heptadecagon (17-gon).

Original entry on oeis.org

2, 2, 7, 3, 5, 4, 9, 1, 8, 9, 8, 4, 1, 6, 5, 5, 1, 4, 8, 2, 4, 2, 3, 7, 2, 3, 8, 7, 3, 9, 3, 7, 6, 3, 5, 7, 6, 1, 0, 6, 4, 1, 9, 9, 1, 4, 6, 9, 3, 3, 0, 9, 8, 8, 6, 0, 3, 5, 6, 5, 9, 4, 4, 0, 3, 9, 7, 2, 3, 2, 5, 1, 4, 8, 7, 9, 6, 7, 7, 7, 5, 7, 4, 7, 6, 4, 6

Offset: 2

Michal Paulovic, Feb 17 2024

This constant multiplied by the square of the side length of a regular heptadecagon equals the area of that heptadecagon.
17^2 divided by this constant equals 68 * tan(Pi/17) = 12.71140300... which is the perimeter and the area of an equable heptadecagon with its side length 4 * tan(Pi/17) = 0.74772958... .
An equable rectangle with its perimeter and area = 17 has side lengths:
  a = s^2/8 = (17 - sqrt(17)) / 4 = (17 - A010473) / 4 = 3.21922359...
  b = 136/s^2 = (17 + sqrt(17)) / 4 = (17 + A010473) / 4 = 5.28077640...
  where s is the parameter from the formula mentioned below.

			22.7354918984165514...

Eric Weisstein's World of Mathematics, Heptadecagon.
Wikipedia, Heptadecagon.

Cf. A007450, A010473, A019684 (Pi/17), A210644 (cos(2*Pi/17)), A210649, A228787, A241243, A329592, A343061.

Maple
```
evalf(17 / (4 * tan(Pi/17)), 100);
```

RealDigits[17 / (4 * Tan[Pi/17]), 10, 100][[1]]

PARI
```
17 / (4 * tan(Pi/17))
```

Equals 17 / (4 * tan(Pi/17)) = 17 / (4 * A343061).
Equals 1 / (4 * A007450 * A343061).
Equals 17 * cos(Pi/17) / (4 * sin(Pi/17)).
Equals 17 * A210649 / (4 * A241243).
Equals 17 * A210649 / (2 * A228787).
Equals 17 * cot(Pi/17) / 4.
Equals 17 * sqrt(4 / (s^2 - 2 * s - 4 * sqrt(17 + 3 * sqrt(17) - s - sqrt(17) * 16/s)) - 1/16) where s = sqrt(34 - 2 * sqrt(17)) = 4 * A329592.
The minimal polynomial is 4294967296*x^16 - 3103113871360*x^14 + 510054948143104*x^12 - 28954726431195136*x^10 + 653743432704327680*x^8 - 6011468019822067712*x^6 + 20881180982314634240*x^4 - 21552361799603318912*x^2 + 2862423051509815793.

cp's OEIS Frontend

A003401 Numbers of edges of regular polygons constructible with ruler (or, more precisely, an unmarked straightedge) and compass.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

PARI

PARI

Python

Formula

Extensions

A272534 Decimal expansion of the edge length of a regular 15-gon with unit circumradius.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A228785 Table of coefficients of the algebraic number s(2*l+1) = 2*sin(Pi/(2*l+1)) as a polynomial in odd powers of rho(2*(2*l+1)) = 2*cos(Pi/(2*(2*l+1))) (reduced version).

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A272535 Decimal expansion of the edge length of a regular 16-gon with unit circumradius.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A272536 Decimal expansion of the edge length of a regular 20-gon with unit circumradius.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A228788 Decimal expansion of the algebraic integer 2*cos(Pi/34) of degree 16 = A055034(34) (over the rationals), the length ratio (smallest diagonal)/side of a regular 34-gon.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A370393 Decimal expansion of the area of a unit heptadecagon (17-gon).

Views

Author

Keywords

Comments

A228785 Table of coefficients of the algebraic number s(2l+1) = 2sin(Pi/(2l+1)) as a polynomial in odd powers of rho(2(2l+1)) = 2cos(Pi/(2(2l+1))) (reduced version).