|
Search: id:A078676
|
|
|
| A078676 |
|
Number of symmetric ways to lace a shoe that has n pairs of eyelets. |
|
+0
4
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The lace must pass through each eyelet exactly once, must begin and end at the extreme pair of eyelets and cannot pass in order though three adjacent eyelets that are in a line.
|
|
LINKS
|
Index entries for sequences related to shoe lacings
N. J. A. Sloane, FORTRAN program
|
|
EXAMPLE
|
a(3) = 7: label the eyelets 1,2,3 from front to back on the left side then 4,5,6 from back to front on the right side. The symmetric lacings are: 124356 154326 153426 142536 145236 132546 135246.
|
|
CROSSREFS
|
Cf. A078602 for directed solutions, A078675 for undirected solutions.
Sequence in context: A050631 A146759 A144059 this_sequence A086331 A121418 A014501
Adjacent sequences: A078673 A078674 A078675 this_sequence A078677 A078678 A078679
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 11 2002
|
|
EXTENSIONS
|
a(7) and a(8) from Hugo Pfoertner (hugo(AT)pfoertner.org), Jan 22 2005
|
|
|
Search completed in 0.002 seconds
|
