|
Search: id:A000682
|
|
|
| A000682 |
|
Semimeanders: number of ways a semi-infinite directed curve can cross a straight line n times. (Formerly M1205 N0464)
|
|
+0 11
|
|
| 1, 1, 2, 4, 10, 24, 66, 174, 504, 1406, 4210, 12198, 37378, 111278, 346846, 1053874, 3328188, 10274466, 32786630, 102511418, 329903058, 1042277722, 3377919260, 10765024432, 35095839848, 112670468128, 369192702554, 1192724674590, 3925446804750
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Number of ways to fold a strip of n+1 labeled stamps.
|
|
REFERENCES
|
I. Jensen, A transfer matrix approach to the enumeration of plane meanders. J. Phys. A 33, 5953-5963 (2000).
I. Jensen and A. J. Guttmann, Critical exponents of plane meanders. J. Phys. A 33, L187-L192 (2000).
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.
A. Sade, Sur les Chevauchements des Permutations, published by the author, Marseille, 1949.
J. Touchard, Contributions a` l'e'tude du proble`me des timbres postes, Canad. J. Math., 2 (1950), 385-398.
|
|
LINKS
|
I. Jensen, Table of n, a(n) for n = 1..45
P. Di Francesco, O. Golinelli and E. Guitter, Meander, folding and arch statistics.
P. Di Francesco, O. Golinelli and E. Guitter, Meanders: a direct enumeration approach, Nucl. Phys. B 482 [ FS ] (1996) 497-535.
I. Jensen, Home page
I. Jensen, More terms
Index entries for sequences obtained by enumerating foldings
P. Di Francesco, Matrix model combinatorics: applications to folding and coloring
|
|
EXAMPLE
|
a(3) = 4: the four solutions with three crossings are the two solutions shown in A086441 together with their reflections about a North-South axis.
|
|
CROSSREFS
|
A000560(n) = a(n)/2 (for n >= 2) gives number of nonisomorphic solutions (see also A086441). Cf. A001011, A001997.
Sequence in context: A084078 A137842 A049146 this_sequence A001997 A000084 A057734
Adjacent sequences: A000679 A000680 A000681 this_sequence A000683 A000684 A000685
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Sade gives the first 11 terms. Computed to n = 45 by Iwan Jensen.
|
|
|
Search completed in 0.002 seconds
|