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.

A050317 Number of ways n is a product of partition numbers > 1.

Table of values

n a(n)
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 1
13 0
14 1
15 2
16 1
17 0
18 1
19 0
20 1
21 1
22 2
23 0
24 1
25 1
26 0
27 1
28 1
29 0
30 3
31 0
32 1
33 1
34 0
35 1
36 1
37 0
38 0
39 0
40 1
41 0
42 2
43 0
44 2
45 2
46 0
47 0
48 1
49 1
50 1
51 0
52 0
53 0
54 1
55 1
56 2
57 0
58 0
59 0
60 3
61 0
62 0
63 1
64 1
65 0
66 2
67 0
68 0
69 0
70 1
71 0
72 1
73 0
74 0
75 2
76 0
77 2
78 0
79 0
80 1
81 1
82 0
83 0
84 2
85 0
86 0
87 0
88 2
89 0
90 3
91 0
92 0
93 0
94 0
95 0
96 1
97 0
98 1
99 1
100 1
101 1
102 0
103 0

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 0, 1, 0, 1, 1, 2, 0, 1, 1, 0, 1, 1, 0, 3, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 2, 0, 2, 2, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 2, 0, 0, 0, 3, 0, 0, 1, 1, 0, 2, 0, 0, 0, 1, 0, 1, 0, 0, 2, 0, 2, 0, 0, 1, 1, 0, 0, 2, 0, 0, 0, 2, 0, 3, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0]