login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020735 Odd numbers >= 5. 2
5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Values of n such that a regular polygon with n sides can be formed by tying knots in a strip of paper. - Robert A. J. Matthews (rajm(AT)compuserve.com)

These polygons fill in many of the gaps left by the Greeks, who were restricted to compass and ruler. Specifically, they make possible construction of the regular 7-sided heptagon, 9-sided nonagon, 11-gon and 13-gon. The 14-gon becomes the first to be impossible by either ruler, compass or knotting.

Continued fraction expansion of 2/(exp(2)-7). - Thomas Baruchel (baruchel(AT)users.sourceforge.net), Nov 04 2003

Pisot sequence T(5,7). - David W. Wilson (davidwwilson(AT)comcast.net)

REFERENCES

F. V. Morley, Proc. Lond. Math. Soc., Jun 1923

F. V. Morley, "Inversive Geometry" (George Bell, 1933; reprinted Chelsea Publishing Co. 1954)

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = 2*n + 3.

G.f.: x*(5-3*x)/(1-2*x+x^2). a(n) = 2*a(n-1)-a(n-2). - Colin Barker, Jan 31 2012

CROSSREFS

Subsequence of A005408. See A008776 for definitions of Pisot sequences.

Sequence in context: A084926 A049013 A062545 * A108144 A123910 A024886

Adjacent sequences:  A020732 A020733 A020734 * A020736 A020737 A020738

KEYWORD

nonn,easy,nice

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

EXTENSIONS

Entry revised by N. J. A. Sloane (njas(AT)research.att.com), Jan 26 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 17:46 EST 2012. Contains 205835 sequences.