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.

A196722 Number of subsets of {1..n} (including empty set) such that the pairwise LCMs of elements are not distinct.

Table of values

n a(n)
0 1
1 2
2 4
3 7
4 11
5 16
6 23
7 30
8 38
9 47
10 58
11 69
12 83
13 96
14 111
15 128
16 144
17 161
18 181
19 200
20 223
21 246
22 269
23 292
24 319
25 344
26 371
27 398
28 429
29 458
30 496
31 527
32 559
33 594
34 629
35 668
36 708
37 745
38 784
39 825
40 870
41 911
42 962
43 1005
44 1052
45 1102
46 1149
47 1196
48 1248
49 1297
50 1349
51 1402
52 1457
53 1510

List of values

[1, 2, 4, 7, 11, 16, 23, 30, 38, 47, 58, 69, 83, 96, 111, 128, 144, 161, 181, 200, 223, 246, 269, 292, 319, 344, 371, 398, 429, 458, 496, 527, 559, 594, 629, 668, 708, 745, 784, 825, 870, 911, 962, 1005, 1052, 1102, 1149, 1196, 1248, 1297, 1349, 1402, 1457, 1510]