cp's OEIS Frontend

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.

A000125 Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.

Table of values

n a(n)
0 1
1 2
2 4
3 8
4 15
5 26
6 42
7 64
8 93
9 130
10 176
11 232
12 299
13 378
14 470
15 576
16 697
17 834
18 988
19 1160
20 1351
21 1562
22 1794
23 2048
24 2325
25 2626
26 2952
27 3304
28 3683
29 4090
30 4526
31 4992
32 5489
33 6018
34 6580
35 7176
36 7807
37 8474
38 9178
39 9920
40 10701
41 11522
42 12384
43 13288
44 14235
45 15226

List of values

[1, 2, 4, 8, 15, 26, 42, 64, 93, 130, 176, 232, 299, 378, 470, 576, 697, 834, 988, 1160, 1351, 1562, 1794, 2048, 2325, 2626, 2952, 3304, 3683, 4090, 4526, 4992, 5489, 6018, 6580, 7176, 7807, 8474, 9178, 9920, 10701, 11522, 12384, 13288, 14235, 15226]