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



Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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


%S 0,2,13,79,523,3883,32323,299443,3061363,34269043,417107443,

%T 5486541043,77576281843,1173531942643,18914314201843,323602441945843,

%U 5857680367321843,111852533939929843,2247044164800217843,47377376416476889843,1046083650772987609843

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

%H Gheorghe Coserea, <a href="/A271475/b271475.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 * n!/2 + sum(k = 2, n-1, k^2 * k!/2);

%o concat(0, vector(20, k, a(k+1))) \\ _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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 14:57 EST 2020. Contains 330958 sequences. (Running on oeis4.)