# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a000136 Showing 1-1 of 1 %I A000136 M1614 N0630 #94 Feb 29 2024 17:50:17 %S A000136 1,2,6,16,50,144,462,1392,4536,14060,46310,146376,485914,1557892, %T A000136 5202690,16861984,56579196,184940388,622945970,2050228360,6927964218, %U A000136 22930109884,77692142980,258360586368,877395996200,2929432171328,9968202968958,33396290888520,113837957337750 %N A000136 Number of ways of folding a strip of n labeled stamps. %D A000136 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A000136 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A000136 M. B. Wells, Elements of Combinatorial Computing. Pergamon, Oxford, 1971, p. 238. %H A000136 T. D. Noe, Table of n, a(n) for n = 1..45 %H A000136 Oswin Aichholzer, Florian Lehner, and Christian Lindorfer, Folding polyominoes into cubes, arXiv:2402.14965 [cs.CG], 2024. See p. 9. %H A000136 T. Asano, E. D. Demaine, M. L. Demaine and R. Uehara, NP-completeness of generalized Kaboozle, J. Information Processing, 20 (July, 2012), 713-718. %H A000136 CombOS - Combinatorial Object Server, Generate meanders and stamp foldings %H A000136 R. Dickau, Stamp Folding %H A000136 R. Dickau, Stamp Folding [Cached copy, pdf format, with permission] %H A000136 J. E. Koehler, Folding a strip of stamps, J. Combin. Theory, 5 (1968), 135-152. %H A000136 J. E. Koehler, Folding a strip of stamps, J. Combin. Theory, 5 (1968), 135-152. [Annotated, corrected, scanned copy] %H A000136 Stéphane Legendre, The 16 foldings of 4 labeled stamps %H A000136 W. F. Lunnon, A map-folding problem, Math. Comp. 22 (1968), 193-199. %H A000136 David Orden, In how many ways can you fold a strip of stamps?, 2014. %H A000136 A. Panayotopoulos, P. Vlamos, Partitioning the Meandering Curves, Mathematics in Computer Science (2015) p 1-10. %H A000136 Frank Ruskey, Information on Stamp Foldings %H A000136 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. %H A000136 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] %H A000136 J. Sawada and R. Li, Stamp foldings, semi-meanders, and open meanders: fast generation algorithms, Electronic Journal of Combinatorics, Volume 19 No. 2 (2012), P#43 (16 pages). %H A000136 Eric Weisstein's World of Mathematics, Stamp Folding %H A000136 M. B. Wells, Elements of Combinatorial Computing, Pergamon, Oxford, 1971. [Annotated scanned copy of pages 237-240] %H A000136 Index entries for sequences obtained by enumerating foldings %F A000136 a(n) = n * A000682(n). - _Andrew Howroyd_, Dec 06 2015 %Y A000136 Equals 2n*A000560 (and so 45 terms are known). %K A000136 nonn %O A000136 1,2 %A A000136 _N. J. A. Sloane_ # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE