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.

A363075 Number of partitions of n such that 3*(least part) + 1 = greatest part.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 1
7 2
8 3
9 6
10 6
11 10
12 12
13 18
14 20
15 27
16 32
17 42
18 47
19 59
20 67
21 85
22 94
23 113
24 126
25 152
26 169
27 198
28 220
29 257
30 282
31 326
32 359
33 413
34 452
35 512
36 563
37 639
38 695
39 781
40 853
41 958
42 1041
43 1161
44 1261
45 1402
46 1524
47 1685
48 1827
49 2021
50 2186
51 2407
52 2604
53 2861
54 3088
55 3385
56 3657
57 4002
58 4316
59 4704
60 5069
61 5531

List of values

[0, 0, 0, 0, 1, 1, 2, 3, 6, 6, 10, 12, 18, 20, 27, 32, 42, 47, 59, 67, 85, 94, 113, 126, 152, 169, 198, 220, 257, 282, 326, 359, 413, 452, 512, 563, 639, 695, 781, 853, 958, 1041, 1161, 1261, 1402, 1524, 1685, 1827, 2021, 2186, 2407, 2604, 2861, 3088, 3385, 3657, 4002, 4316, 4704, 5069, 5531]