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.

A330146 Number of partitions p of n such that (number of numbers in p that have multiplicity 1) <= (number of numbers in p having multiplicity > 1).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 3
5 4
6 7
7 9
8 13
9 16
10 24
11 29
12 39
13 51
14 69
15 87
16 118
17 152
18 199
19 256
20 330
21 418
22 534
23 670
24 838
25 1046
26 1296
27 1603
28 1960
29 2412
30 2936
31 3588
32 4342
33 5288
34 6364
35 7713
36 9272
37 11186
38 13389
39 16117
40 19213
41 23032
42 27408
43 32715
44 38810
45 46176
46 54582
47 64692
48 76286

List of values

[1, 0, 1, 1, 3, 4, 7, 9, 13, 16, 24, 29, 39, 51, 69, 87, 118, 152, 199, 256, 330, 418, 534, 670, 838, 1046, 1296, 1603, 1960, 2412, 2936, 3588, 4342, 5288, 6364, 7713, 9272, 11186, 13389, 16117, 19213, 23032, 27408, 32715, 38810, 46176, 54582, 64692, 76286]