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.

A353501 Number of integer partitions of n with all parts and all multiplicities > 2.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 1
10 0
11 0
12 2
13 0
14 0
15 2
16 1
17 0
18 2
19 0
20 2
21 3
22 0
23 0
24 6
25 2
26 0
27 6
28 3
29 2
30 9
31 2
32 5
33 11
34 3
35 5
36 18
37 6
38 4
39 20
40 13
41 8
42 26
43 10
44 17
45 37
46 14
47 16
48 51
49 23
50 24
51 58
52 38
53 32
54 75
55 44
56 52
57 100
58 52
59 59
60 143
61 75
62 77
63 159
64 114
65 112
66 203
67 132
68 154
69 266
70 175

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0, 2, 1, 0, 2, 0, 2, 3, 0, 0, 6, 2, 0, 6, 3, 2, 9, 2, 5, 11, 3, 5, 18, 6, 4, 20, 13, 8, 26, 10, 17, 37, 14, 16, 51, 23, 24, 58, 38, 32, 75, 44, 52, 100, 52, 59, 143, 75, 77, 159, 114, 112, 203, 132, 154, 266, 175]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.