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.

A300509 a(n) is the number of numbers in the interval [2^(n-1), 2^n-1] that have exactly n divisors.

Table of values

n a(n)
1 1
2 2
3 1
4 4
5 1
6 6
7 1
8 25
9 3
10 10
11 1
12 212
13 1
14 27
15 8
16 3625
17 1
18 1291
19 1
20 7687
21 18
22 265
23 1
24 629369
25 4
26 885
27 695
28 365370
29 1
30 685360
31 1
32 178723829
33 131
34 10782
35 12
36 311470930
37 1
38 38692
39 413
40 6162245368
41 1
42 381481569
43 1
44 1067082439
45 139407
46 513855
47 1

List of values

[1, 2, 1, 4, 1, 6, 1, 25, 3, 10, 1, 212, 1, 27, 8, 3625, 1, 1291, 1, 7687, 18, 265, 1, 629369, 4, 885, 695, 365370, 1, 685360, 1, 178723829, 131, 10782, 12, 311470930, 1, 38692, 413, 6162245368, 1, 381481569, 1, 1067082439, 139407, 513855, 1]