Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3)+n+1.
1, 2, 4, 8, 15, 26, 42, 64, 93, 130, 176, 232, 299, 378, 470, 576, 697, 834, 988, 1160
1 seqfan posts
Fri Oct 29 05:35:16 CEST 2010 [seqfan] Implementing first 500 sequences in Java