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.

A350892 Number of partitions of n such that 3*(smallest part) = (number of parts).

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 2
6 2
7 3
8 3
9 4
10 4
11 5
12 6
13 7
14 8
15 10
16 12
17 15
18 18
19 22
20 27
21 33
22 40
23 48
24 58
25 69
26 82
27 98
28 115
29 135
30 158
31 184
32 214
33 248
34 286
35 330
36 379
37 435
38 497
39 569
40 648
41 739
42 840
43 955
44 1082
45 1228
46 1388
47 1572
48 1775
49 2005
50 2259
51 2549
52 2867
53 3228
54 3626
55 4076
56 4571
57 5131
58 5745
59 6438
60 7199
61 8053
62 8992
63 10045
64 11199

List of values

[0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 7, 8, 10, 12, 15, 18, 22, 27, 33, 40, 48, 58, 69, 82, 98, 115, 135, 158, 184, 214, 248, 286, 330, 379, 435, 497, 569, 648, 739, 840, 955, 1082, 1228, 1388, 1572, 1775, 2005, 2259, 2549, 2867, 3228, 3626, 4076, 4571, 5131, 5745, 6438, 7199, 8053, 8992, 10045, 11199]