This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A078942 #11 Jun 24 2014 01:08:34 %S A078942 1,4,6,8,10,12,14,15,17,18,19,21,22,23,24,26,28,29 %N A078942 Flipping burnt pancakes. Given a sorted stack of n burnt pancakes of different sizes (smallest on top, ..., largest at the bottom), each with its burnt side up, a(n) is the number of spatula flips needed to restore them to their initial order but with the burnt sides down. %C A078942 In a 'spatula flip', a spatula is inserted below any pancake and all pancakes above the spatula are lifted and replaced in reverse order. %C A078942 It is conjectured that this initial configuration is a worst case for the general problem of sorting burnt pancakes. If so, then this sequence is identical to A078941. %D A078942 David S. Cohen and Manuel Blum, "On the problem of sorting burnt pancakes", Discrete Applied Math., 61 (1995) 105-120. %H A078942 Douglas B. West, <a href="http://www.math.uiuc.edu/~west/openp/pancake.html">The Pancake Problems (1975, 1979, 1973)</a> - From _N. J. A. Sloane_, Jul 26 2012 %F A078942 a(n) <= A078941(n). a(n+1) <= a(n) + 2. 3n/2 <= a(n) <= 47n/30 + c for some constant c. %Y A078942 Cf. A078941, A058986. %K A078942 nonn,more %O A078942 1,2 %A A078942 _Dean Hickerson_, Dec 18 2002