[go: up one dir, main page]

login
A240802
Smallest possible value of maximal overlap in any layout for the 2^n-node shuffle-exchange graph.
1
2, 3, 6, 10, 18, 33
OFFSET
3,1
LINKS
Frank Thomson Leighton, Margaret Lepley, and Gary L. Miller, Layouts for the shuffle-exchange graph based on the complex plane diagram, SIAM J. Algebraic Discrete Methods 5 (1984), no. 2, 202--215. MR0745439 (85j:68056). See Table 1.
Eric Weisstein's World of Mathematics, Shuffle-Exchange Graph
CROSSREFS
Cf. A192033.
Sequence in context: A018166 A144026 A054152 * A339808 A089985 A191518
KEYWORD
nonn,more,changed
AUTHOR
N. J. A. Sloane, Apr 13 2014
STATUS
approved