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.

A350897 Number of partitions of n such that 5*(smallest part) = (number of parts).

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 1
7 2
8 3
9 5
10 6
11 9
12 11
13 15
14 18
15 23
16 27
17 34
18 39
19 47
20 55
21 65
22 74
23 87
24 99
25 115
26 131
27 151
28 172
29 199
30 226
31 260
32 298
33 343
34 393
35 454
36 522
37 603
38 696
39 804
40 929
41 1076
42 1243
43 1438
44 1664
45 1924
46 2222
47 2567
48 2961
49 3413
50 3931
51 4520
52 5193
53 5959
54 6827
55 7811
56 8928
57 10186
58 11607
59 13208
60 15008
61 17028
62 19297

List of values

[0, 0, 0, 0, 1, 1, 2, 3, 5, 6, 9, 11, 15, 18, 23, 27, 34, 39, 47, 55, 65, 74, 87, 99, 115, 131, 151, 172, 199, 226, 260, 298, 343, 393, 454, 522, 603, 696, 804, 929, 1076, 1243, 1438, 1664, 1924, 2222, 2567, 2961, 3413, 3931, 4520, 5193, 5959, 6827, 7811, 8928, 10186, 11607, 13208, 15008, 17028, 19297]