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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A271477 Total number of burnt pancakes flipped using the Max-bar(n) greedy algorithm. 1

%I

%S 1,11,115,1315,17059,251299,4168099,77066659,1573745059,35202560419,

%T 856414515619,22520060211619,636623103488419,19255913457152419,

%U 620582474248909219,21231371719439053219,768533168883921613219,29346999327603454669219,1179012538436940624589219,49713360071230827164365219

%N Total number of burnt pancakes flipped using the Max-bar(n) greedy algorithm.

%H Gheorghe Coserea, <a href="/A271477/b271477.txt">Table of n, a(n) for n = 1..128</a>

%H J. Sawada, A. Williams, <a href="http://www.cis.uoguelph.ca/~sawada/papers/pancake_successor.pdf">Successor rules for flipping pancakes and burnt pancakes</a>, Preprint, Theoretical Computer Science, Volume 609, Part 1, 4 January 2016, Pages 60-75.

%o (PARI)

%o a(n) = n * 2^n * n!/2 + sum(k=1, n-1, (2*k+1) * k * 2^k * k!/2);

%o vector(20, k, a(k)) \\ _Gheorghe Coserea_, Apr 25 2016

%K nonn

%O 1,2

%A _N. J. A. Sloane_, Apr 09 2016

%E More terms from _Gheorghe Coserea_, Apr 25 2016

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.

Last modified August 11 18:37 EDT 2020. Contains 336428 sequences. (Running on oeis4.)