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.

A062890 Number of quadrilaterals that can be formed with perimeter n. In other words, number of partitions of n into four parts such that the sum of any three is more than the fourth.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 1
6 1
7 2
8 3
9 4
10 5
11 7
12 8
13 11
14 12
15 16
16 18
17 23
18 24
19 31
20 33
21 41
22 43
23 53
24 55
25 67
26 69
27 83
28 86
29 102
30 104
31 123
32 126
33 147
34 150
35 174
36 177
37 204
38 207
39 237
40 241
41 274
42 277
43 314
44 318
45 358
46 362
47 406
48 410
49 458
50 462
51 514
52 519
53 575
54 579
55 640
56 645
57 710

List of values

[0, 0, 0, 0, 1, 1, 1, 2, 3, 4, 5, 7, 8, 11, 12, 16, 18, 23, 24, 31, 33, 41, 43, 53, 55, 67, 69, 83, 86, 102, 104, 123, 126, 147, 150, 174, 177, 204, 207, 237, 241, 274, 277, 314, 318, 358, 362, 406, 410, 458, 462, 514, 519, 575, 579, 640, 645, 710]