|
Search: id:A141135
|
|
|
| A141135 |
|
Minimal number of unit edges required to construct n regular pentagons when allowing edge-sharing. |
|
+0
1
|
|
| 5, 9, 13, 17, 21, 24, 28, 32, 36, 39, 43, 47, 50, 54, 58, 61, 65, 69, 72, 76
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
Ralph H. Buchholz and Warwick de Launey, An edge minimization problem for regular polygons, June 1996, (revised June 2008).
Ralph H. Buchholz, Spiral polygon series, School Mathematics Journal, 1995.
|
|
LINKS
|
R. H. Buchholz, Spiral polygon series.
R. H. Buchholz, Edge minimization.
|
|
EXAMPLE
|
a(6) = 24 since the first pentagon requires 5 edges, the 2nd, 3rd, 4th and 5th pentagons require an additional 4 edges each and the 6th pentagon requires 3 edges since it can share 2 edges (if one tiles via a 6-cycle). Thus 24 = 5 + 4 + 4 + 4 + 4 + 3.
|
|
CROSSREFS
|
Cf. equilateral triangles A137228, squares A078633, regular hexagons A135708.
Sequence in context: A080590 A051541 A086408 this_sequence A162502 A016813 A004766
Adjacent sequences: A141132 A141133 A141134 this_sequence A141136 A141137 A141138
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ralph H. Buchholz (teufel_pi(AT)yahoo.com), Jun 08 2008
|
|
|
Search completed in 0.002 seconds
|
