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.

A386360 Number of partitions of n such that the least part occurs exactly (1/3)*(number of parts) times.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 1
7 2
8 3
9 4
10 6
11 8
12 10
13 13
14 17
15 21
16 27
17 33
18 41
19 50
20 63
21 75
22 93
23 111
24 136
25 163
26 198
27 235
28 285
29 337
30 406
31 479
32 574
33 676
34 806
35 948
36 1124
37 1318
38 1557
39 1822
40 2147
41 2505
42 2940
43 3424
44 4006
45 4657
46 5431
47 6299
48 7329
49 8483
50 9843
51 11372
52 13163
53 15177
54 17527
55 20175

List of values

[0, 0, 0, 0, 1, 1, 2, 3, 4, 6, 8, 10, 13, 17, 21, 27, 33, 41, 50, 63, 75, 93, 111, 136, 163, 198, 235, 285, 337, 406, 479, 574, 676, 806, 948, 1124, 1318, 1557, 1822, 2147, 2505, 2940, 3424, 4006, 4657, 5431, 6299, 7329, 8483, 9843, 11372, 13163, 15177, 17527, 20175]