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.

A370587 Number of subsets of {1..n} containing n such that it is not possible to choose a different prime factor of each element (non-choosable).

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 6
5 10
6 24
7 44
8 116
9 236
10 468
11 908
12 1960
13 3776
14 7812
15 15876
16 32504
17 63744
18 130104
19 257592
20 521152
21 1042976
22 2087096
23 4166408
24 8376816
25 16760832
26 33507744
27 67089280
28 134169440
29 268236928
30 536759984
31 1073233840
32 2147384000
33 4294503744
34 8589075216
35 17179048048

List of values

[0, 1, 1, 2, 6, 10, 24, 44, 116, 236, 468, 908, 1960, 3776, 7812, 15876, 32504, 63744, 130104, 257592, 521152, 1042976, 2087096, 4166408, 8376816, 16760832, 33507744, 67089280, 134169440, 268236928, 536759984, 1073233840, 2147384000, 4294503744, 8589075216, 17179048048]