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.

A174094 Number of ways to choose n positive integers less than or equal to 2n such that none of the n integers divides another.

Table of values

n a(n)
0 1
1 2
2 2
3 3
4 5
5 4
6 6
7 12
8 10
9 14
10 26
11 26
12 34
13 68
14 48
15 72
16 120
17 120
18 168
19 336
20 264
21 396
22 792
23 624
24 816
25 1632
26 1632
27 2208
28 3616
29 3616
30 5056
31 10112
32 6592
33 9888
34 19776
35 19776
36 24384
37 48768
38 48768
39 73152
40 112320
41 76032
42 114048
43 228096
44 190080
45 264960
46 529920

List of values

[1, 2, 2, 3, 5, 4, 6, 12, 10, 14, 26, 26, 34, 68, 48, 72, 120, 120, 168, 336, 264, 396, 792, 624, 816, 1632, 1632, 2208, 3616, 3616, 5056, 10112, 6592, 9888, 19776, 19776, 24384, 48768, 48768, 73152, 112320, 76032, 114048, 228096, 190080, 264960, 529920]