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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #50 Feb 19 2024 10:39:24
%S 1,1,1,3,20,2,35,455,5804,73232,6,167,2001,24974,339220,4646117,
%T 65758725
%N Number of stacks of n pancakes requiring a maximum number of flips to order.
%C a(n) is the last term in row n in A092113. - _Joerg Arndt_, Mar 01 2023
%C a(18) >= 12357059, a(19) >= 410 from J. Cibulka's webpage. - _Dan Dima_, Feb 19 2024
%H Josef Cibulka, <a href="https://arxiv.org/abs/0901.3119">Average number of flips in pancake sorting</a>, arXiv:0901.3119 [cs.DM], 2009.
%H Josef Cibulka, <a href="https://doi.org/10.1016/j.tcs.2010.11.028">On average and highest number of flips in pancake sorting</a>, Theoretical Computer Science, Volume 412, Issue 8-10, March 2011, pp 822-834.
%H Josef Cibulka, <a href="https://iuuk.mff.cuni.cz/~cibulka/pancakes/">Pancake sorting</a>, webpage.
%H Mohammad Hossain Heydari and Ivan Hal Sudborough, <a href="https://doi.org/10.1006/jagm.1997.0874">On the Diameter of the Pancake Network</a>, Journal of Algorithms, Volume 25, Issue 1 Oct. 1997, pp. 67-94.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PancakeSorting.html">Pancake Sorting</a>.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Pancake_sorting">Pancake sorting</a>.
%Y Cf. A058986, A092113.
%K nonn,hard,more
%O 1,4
%A _Eric W. Weisstein_
%E Corrected and extended by _Rob Pratt_, Feb 21 2004
%E a(11)-a(12) from _Sean A. Irvine_, Dec 23 2023
%E a(13)-a(17) from _Dan Dima_, Feb 10 2024