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.

A141213 Defining A to be the interior angle of a regular polygon, the number of constructible regular polygons such that A is in a field extension = degree 2^n, starting with n=0. This is also the number of values of x such that phi(x)/2 = 2^n (where phi is Euler's phi function), also starting with n=0.

Original entry on oeis.org

3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 34, 34
Offset: 0

Views

Author

Matthew Lehman, Jun 14 2008

Keywords

Examples

			For degree 2^0, there are 3 polygons with 3, 4 & 6 sides.
For degree 2^1, there are 4 polygons with 5, 8, 10 & 12 sides.
For degree 2^2 there are 5 polygons with 15, 16, 20, 24 & 30 sides.
For n<=31, for degree 2^n, there are n+3 polygons.
For n>= 31 there are 34 polygons.
Assuming there are only five Fermat primes, the sequence will continue repeating 34 forever.
		

Crossrefs

Cf. A141214.

Formula

For n<=31, f(n)=n+3; for n>=31, f(n)=34.