|
|
A000136
|
|
Number of ways of folding a strip of n labeled stamps.
(Formerly M1614 N0630)
|
|
15
|
|
|
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;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
M. B. Wells, Elements of Combinatorial Computing. Pergamon, Oxford, 1971, p. 238.
|
|
LINKS
|
R. Dickau, Stamp Folding [Cached copy, pdf format, with permission]
M. A. Sainte-Laguë, Les Réseaux (ou Graphes), Mémorial des Sciences Mathématiques, Fasc. 18, Gauthier-Villars, Paris, 1923, 64 pages. See p. 41.
M. A. Sainte-Laguë, Les Réseaux (ou Graphes), Mémorial des Sciences Mathématiques, Fasc. 18, Gauthier-Villars, Paris, 1923, 64 pages. See p. 41. [Incomplete annotated scan of title page and pages 18-51]
|
|
FORMULA
|
|
|
CROSSREFS
|
Equals 2n*A000560 (and so 45 terms are known).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|