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.

A382682 Number of integer partitions of n with origin-to-boundary graph-distance equal to 3.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 1
7 4
8 8
9 15
10 23
11 32
12 43
13 54
14 67
15 82
16 97
17 114
18 133
19 152
20 173
21 196
22 219
23 244
24 271
25 298
26 327
27 358
28 389
29 422
30 457
31 492
32 529
33 568
34 607
35 648
36 691
37 734
38 779
39 826
40 873
41 922
42 973
43 1024
44 1077
45 1132
46 1187
47 1244
48 1303
49 1362
50 1423
51 1486
52 1549
53 1614
54 1681
55 1748
56 1817
57 1888
58 1959

List of values

[0, 0, 0, 0, 0, 0, 1, 4, 8, 15, 23, 32, 43, 54, 67, 82, 97, 114, 133, 152, 173, 196, 219, 244, 271, 298, 327, 358, 389, 422, 457, 492, 529, 568, 607, 648, 691, 734, 779, 826, 873, 922, 973, 1024, 1077, 1132, 1187, 1244, 1303, 1362, 1423, 1486, 1549, 1614, 1681, 1748, 1817, 1888, 1959]