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.

A350896 Number of partitions of n such that 4*(smallest part) = (number of parts).

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 1
6 2
7 3
8 4
9 5
10 7
11 8
12 10
13 12
14 14
15 16
16 20
17 22
18 26
19 30
20 35
21 40
22 48
23 55
24 65
25 76
26 90
27 105
28 126
29 147
30 175
31 206
32 244
33 286
34 339
35 396
36 467
37 545
38 638
39 741
40 865
41 1000
42 1160
43 1337
44 1543
45 1770
46 2035
47 2325
48 2660
49 3029
50 3451
51 3916
52 4447
53 5029
54 5691
55 6419
56 7242
57 8146
58 9167
59 10286
60 11546
61 12930
62 14481
63 16185

List of values

[0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, 14, 16, 20, 22, 26, 30, 35, 40, 48, 55, 65, 76, 90, 105, 126, 147, 175, 206, 244, 286, 339, 396, 467, 545, 638, 741, 865, 1000, 1160, 1337, 1543, 1770, 2035, 2325, 2660, 3029, 3451, 3916, 4447, 5029, 5691, 6419, 7242, 8146, 9167, 10286, 11546, 12930, 14481, 16185]