|
Search: id:A078941
|
|
|
| A078941 |
|
Flipping burnt pancakes. Maximum number of spatula flips to sort a stack of n pancakes of different sizes, each burnt on one side, so that the smallest ends up on top, ..., the largest at the bottom, and each has its burnt side down. |
|
+0
4
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
In a 'spatula flip', a spatula is inserted below any pancake, and all pancakes above the spatula are lifted and replaced in reverse order.
It is conjectured that the initial configuration in which the pancakes are in the correct order but all of the burnt sides are up is a worst case for the problem. If so, then this sequence is identical to A078942.
|
|
REFERENCES
|
David S. Cohen and Manuel Blum, "On the problem of sorting burnt pancakes", Discrete Applied Math., 61 (1995) 105-120.
|
|
FORMULA
|
a(n) >= A078942(n). a(n+1) <= a(n) + 2. 3n/2 <= a(n) <= 2n-2, where the upper bound holds for n>=10.
|
|
CROSSREFS
|
Cf. A078942. A058986 treats the unburnt case.
Sequence in context: A063287 A134331 A090334 this_sequence A078942 A039767 A054023
Adjacent sequences: A078938 A078939 A078940 this_sequence A078942 A078943 A078944
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Dean Hickerson (dean(AT)math.ucdavis.edu), Dec 18 2002
|
|
|
Search completed in 0.002 seconds
|
