Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/ConstructibleNumber.html">Constructible Number</a>.

Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/ConstructiblePolygon.html">Constructible Polygon</a>.

Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/RegularPolygon.html">Regular Polygon</a>.

Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/Trigonometry.html">Trigonometry</a>.

Eric Weisstein's World of Mathematics, <a href="httphttps://mathworld.wolfram.com/TrigonometryAngles.html">Trigonometry Angles</a>.

Amiram Eldar, <a href="/A003401/b003401_1.txt">Table of n, a(n) for n = 1..10136</a> (terms below 10^100; terms 1..2000 from T. D. Noe)

reviewed

approved

proposed

reviewed

editing

proposed

A. Albert H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 183.

Duane W. DeTemple, Duane W. "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

R. Richard K. Guy, <a href="/A005347/a005347.pdf">The Second Strong Law of Small Numbers</a>, Math. Mag. 63(1) (1990), 3-20. [Annotated scanned copy] <a href="https://doi.org/10.2307/2691503">[DOI]</a>

R. Richard K. Guy and N. J. A. Sloane, <a href="/A005180/a005180.pdf">Correspondence</a>, 1988.

Amiram Eldar, <a href="/A003401/b003401_1.txt">Table of n, a(n) for n = 1..10136</a> (terms below 10^100; terms 1..2000 from T. D. Noe)

T. D. Noe, Amiram Eldar, <a href="/A003401/b003401_1.txt">Table of n, a(n) for n = 1..200010136</a>

approved

editing

editing

approved

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

proposed

editing