A003600 - cp's OEIS frontend

A003600 Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n^3 + 3n^2 + 8n)/6 (n > 0).

n	a(n)
0	1
1	2
2	6
3	13
4	24
5	40
6	62
7	91
8	128
9	174
10	230
11	297
12	376
13	468
14	574
15	695
16	832
17	986
18	1158
19	1349
20	1560
21	1792
22	2046
23	2323
24	2624
25	2950
26	3302
27	3681
28	4088
29	4524
30	4990
31	5487
32	6016
33	6578
34	7174
35	7805
36	8472
37	9176
38	9918
39	10699
40	11520
41	12382
42	13286
43	14233
44	15224

[1, 2, 6, 13, 24, 40, 62, 91, 128, 174, 230, 297, 376, 468, 574, 695, 832, 986, 1158, 1349, 1560, 1792, 2046, 2323, 2624, 2950, 3302, 3681, 4088, 4524, 4990, 5487, 6016, 6578, 7174, 7805, 8472, 9176, 9918, 10699, 11520, 12382, 13286, 14233, 15224]

cp's OEIS Frontend

A003600 Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n^3 + 3n^2 + 8n)/6 (n > 0).

Table of values

List of values

cp's OEIS Frontend

A003600 Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n^3 + 3*n^2 + 8*n)/6 (n > 0).

Table of values

List of values

A003600 Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n^3 + 3n^2 + 8n)/6 (n > 0).