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.

A330145 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 1
2 1
3 2
4 3
5 6
6 7
7 13
8 16
9 24
10 30
11 43
12 52
13 73
14 91
15 122
16 154
17 204
18 258
19 335
20 423
21 545
22 684
23 865
24 1081
25 1348
26 1675
27 2073
28 2546
29 3123
30 3821
31 4648
32 5656
33 6851
34 8282
35 9966
36 12031
37 14416
38 17315
39 20695
40 24754
41 29477
42 35170
43 41738
44 49638
45 58735
46 69613
47 82119

List of values

[1, 1, 1, 2, 3, 6, 7, 13, 16, 24, 30, 43, 52, 73, 91, 122, 154, 204, 258, 335, 423, 545, 684, 865, 1081, 1348, 1675, 2073, 2546, 3123, 3821, 4648, 5656, 6851, 8282, 9966, 12031, 14416, 17315, 20695, 24754, 29477, 35170, 41738, 49638, 58735, 69613, 82119]