A387133 - cp's OEIS frontend

A387133 Number of ways to choose a sequence of distinct integer partitions, one of each prime factor of n (with multiplicity).

n	a(n)
1	1
2	2
3	3
4	2
5	7
6	6
7	15
8	0
9	6
10	14
11	56
12	6
13	101
14	30
15	21
16	0
17	297
18	12
19	490
20	14
21	45
22	112
23	1255
24	0
25	42
26	202
27	6
28	30
29	4565
30	42
31	6842
32	0
33	168
34	594
35	105
36	12
37	21637
38	980
39	303
40	0
41	44583
42	90
43	63261
44	112
45	42
46	2510
47	124754
48	0
49	210
50	84
51	891
52	202
53	329931
54	12
55	392
56	0
57	1470
58	9130

[1, 2, 3, 2, 7, 6, 15, 0, 6, 14, 56, 6, 101, 30, 21, 0, 297, 12, 490, 14, 45, 112, 1255, 0, 42, 202, 6, 30, 4565, 42, 6842, 0, 168, 594, 105, 12, 21637, 980, 303, 0, 44583, 90, 63261, 112, 42, 2510, 124754, 0, 210, 84, 891, 202, 329931, 12, 392, 0, 1470, 9130]

cp's OEIS Frontend

A387133 Number of ways to choose a sequence of distinct integer partitions, one of each prime factor of n (with multiplicity).

Table of values

List of values