|
Search: id:A000136
|
|
|
| A000136 |
|
Number of ways of folding a strip of n labeled stamps. (Formerly M1614 N0630)
|
|
+0 1
|
|
| 1, 2, 6, 16, 50, 144, 462, 1392, 4536, 14060, 46310, 146376, 485914, 1557892, 5202690, 16861984, 56579196, 184940388, 622945970, 2050228360, 6927964218, 22930109884, 77692142980, 258360586368, 877395996200, 2929432171328, 9968202968958, 33396290888520, 113837957337750
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
J. E. Koehler, Folding a strip of stamps, J. Combin. Theory, 5 (1968), 135-152.
W. F. Lunnon, A map-folding problem, Math. Comp. 22 (1968), 193-199.
M. B. Wells, Elements of Combinatorial Computing. Pergamon, Oxford, 1971, p. 238.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
Index entries for sequences obtained by enumerating foldings
|
|
CROSSREFS
|
Equals 2n*A000560.
Adjacent sequences: A000133 A000134 A000135 this_sequence A000137 A000138 A000139
Sequence in context: A052890 A052814 A151445 this_sequence A013989 A002841 A136509
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|