login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A240802 Smallest possible value of maximal overlap in any layout for the 2^n-node shuffle-exchange graph. 1

%I

%S 2,3,6,10,18,33

%N Smallest possible value of maximal overlap in any layout for the 2^n-node shuffle-exchange graph.

%H Frank Thomson Leighton, Margaret Lepley, and Gary L. Miller, <a href="http://dx.doi.org/10.1137/0605021">Layouts for the shuffle-exchange graph based on the complex plane diagram</a>, SIAM J. Algebraic Discrete Methods 5 (1984), no. 2, 202--215. MR0745439 (85j:68056). See Table 1.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Shuffle-ExchangeGraph.html">Shuffle-Exchange Graph</a>

%Y Cf. A192033.

%K nonn,more

%O 3,1

%A _N. J. A. Sloane_, Apr 13 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 02:40 EST 2021. Contains 349469 sequences. (Running on oeis4.)