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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 1
7 1
8 2
9 3
10 5
11 8
12 10
13 14
14 19
15 25
16 33
17 41
18 51
19 65
20 79
21 97
22 116
23 140
24 165
25 198
26 233
27 272
28 316
29 369
30 422
31 493
32 561
33 643
34 731
35 835
36 943
37 1072
38 1205
39 1359
40 1524
41 1717
42 1911
43 2147
44 2387
45 2665
46 2960
47 3295
48 3640
49 4049
50 4469
51 4950
52 5455
53 6028
54 6622
55 7310
56 8024
57 8826
58 9676
59 10632
60 11627
61 12765

List of values

[0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 8, 10, 14, 19, 25, 33, 41, 51, 65, 79, 97, 116, 140, 165, 198, 233, 272, 316, 369, 422, 493, 561, 643, 731, 835, 943, 1072, 1205, 1359, 1524, 1717, 1911, 2147, 2387, 2665, 2960, 3295, 3640, 4049, 4469, 4950, 5455, 6028, 6622, 7310, 8024, 8826, 9676, 10632, 11627, 12765]