login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000136 Number of ways of folding a strip of n labeled stamps.
(Formerly M1614 N0630)
5
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; internal format)
OFFSET

1,2

REFERENCES

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.

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

T. D. Noe, Table of n, a(n) for n = 1..45

Eric Weisstein's World of Mathematics, Stamp Folding

Index entries for sequences obtained by enumerating foldings

CROSSREFS

Equals 2n*A000560 (and so 45 terms are known).

Sequence in context: A192401 A151445 A195645 * A013989 A002841 A136509

Adjacent sequences:  A000133 A000134 A000135 * A000137 A000138 A000139

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 12 14:01 EST 2012. Contains 205413 sequences.