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.

A069906 Number of pentagons that can be formed with perimeter n. In other words, number of partitions of n into five parts such that the sum of any four is more than the fifth.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 1
6 1
7 2
8 2
9 4
10 5
11 8
12 9
13 14
14 16
15 23
16 25
17 35
18 39
19 52
20 57
21 74
22 81
23 103
24 111
25 139
26 150
27 184
28 197
29 239
30 256
31 306
32 325
33 385
34 409
35 480
36 507
37 590
38 623
39 719
40 756
41 867
42 911
43 1038
44 1087
45 1232
46 1289
47 1453
48 1516
49 1701
50 1774
51 1981
52 2061
53 2293

List of values

[0, 0, 0, 0, 0, 1, 1, 2, 2, 4, 5, 8, 9, 14, 16, 23, 25, 35, 39, 52, 57, 74, 81, 103, 111, 139, 150, 184, 197, 239, 256, 306, 325, 385, 409, 480, 507, 590, 623, 719, 756, 867, 911, 1038, 1087, 1232, 1289, 1453, 1516, 1701, 1774, 1981, 2061, 2293]