Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078674
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078674 Number of ways to lace a shoe that has n pairs of eyelets, assuming the lacing satisfies certain conditions. +0
2
1, 3, 50, 2122, 155712, 17441962 (list; graph; listen)
OFFSET

1,2

COMMENT

The lace must follow a Hamiltonian path through the 2n eyelets and cannot pass in order though three adjacent eyelets that are in a line.

The lace is "undirected": reversing the order of eyelets along the path does not count as a different solution (cf. A078629).

LINKS

Index entries for sequences related to shoe lacings

CROSSREFS

Apart from initial term, A078629/2.

Sequence in context: A034201 A099346 A075184 this_sequence A071094 A062216 A045489

Adjacent sequences: A078671 A078672 A078673 this_sequence A078675 A078676 A078677

KEYWORD

nonn

AUTHOR

njas, Dec 16 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research