A196719 - cp's OEIS frontend

A196719 Number of subsets of {1..n} (including empty set) such that the pairwise GCDs of elements are all distinct.

n	a(n)
0	1
1	2
2	4
3	7
4	11
5	16
6	24
7	31
8	40
9	52
10	68
11	79
12	102
13	115
14	140
15	175
16	201
17	218
18	265
19	284
20	336
21	396
22	446
23	469
24	547
25	599
26	662
27	742
28	837
29	866
30	1034
31	1065
32	1153
33	1275
34	1370
35	1511
36	1719
37	1756
38	1869
39	2030
40	2244
41	2285
42	2613
43	2656
44	2865
45	3236
46	3394
47	3441
48	3780
49	3921
50	4232

[1, 2, 4, 7, 11, 16, 24, 31, 40, 52, 68, 79, 102, 115, 140, 175, 201, 218, 265, 284, 336, 396, 446, 469, 547, 599, 662, 742, 837, 866, 1034, 1065, 1153, 1275, 1370, 1511, 1719, 1756, 1869, 2030, 2244, 2285, 2613, 2656, 2865, 3236, 3394, 3441, 3780, 3921, 4232]

cp's OEIS Frontend

A196719 Number of subsets of {1..n} (including empty set) such that the pairwise GCDs of elements are all distinct.

Table of values

List of values