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.

A000124 Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.

Table of values

n a(n)
0 1
1 2
2 4
3 7
4 11
5 16
6 22
7 29
8 37
9 46
10 56
11 67
12 79
13 92
14 106
15 121
16 137
17 154
18 172
19 191
20 211
21 232
22 254
23 277
24 301
25 326
26 352
27 379
28 407
29 436
30 466
31 497
32 529
33 562
34 596
35 631
36 667
37 704
38 742
39 781
40 821
41 862
42 904
43 947
44 991
45 1036
46 1082
47 1129
48 1177
49 1226
50 1276
51 1327
52 1379

List of values

[1, 2, 4, 7, 11, 16, 22, 29, 37, 46, 56, 67, 79, 92, 106, 121, 137, 154, 172, 191, 211, 232, 254, 277, 301, 326, 352, 379, 407, 436, 466, 497, 529, 562, 596, 631, 667, 704, 742, 781, 821, 862, 904, 947, 991, 1036, 1082, 1129, 1177, 1226, 1276, 1327, 1379]