A023995 - cp's OEIS frontend

A023995 Number of sets S = {a_1, a_2, ..., a_k}, with 1 < a_i < a_j <= n such that no a_j divides the product of all the others.

n	a(n)
1	1
2	2
3	4
4	6
5	12
6	16
7	32
8	44
9	64
10	86
11	172
12	204
13	408
14	544
15	660
16	860
17	1720
18	2080
19	4160
20	4800
21	5792
22	7784
23	15568
24	17440
25	23648
26	31616
27	40976
28	46584
29	93168
30	102768
31	205536
32	261600
33	316160
34	426304
35	479616
36	524112
37	1048224
38	1407856
39	1699568
40	1848384
41	3696768
42	4049376
43	8098752
44	9292544

[1, 2, 4, 6, 12, 16, 32, 44, 64, 86, 172, 204, 408, 544, 660, 860, 1720, 2080, 4160, 4800, 5792, 7784, 15568, 17440, 23648, 31616, 40976, 46584, 93168, 102768, 205536, 261600, 316160, 426304, 479616, 524112, 1048224, 1407856, 1699568, 1848384, 3696768, 4049376, 8098752, 9292544]

cp's OEIS Frontend

A023995 Number of sets S = {a_1, a_2, ..., a_k}, with 1 < a_i < a_j <= n such that no a_j divides the product of all the others.

Table of values

List of values