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.

A069654 a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) having exactly n divisors.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 16
6 18
7 64
8 66
9 100
10 112
11 1024
12 1035
13 4096
14 4288
15 4624
16 4632
17 65536
18 65572
19 262144
20 262192
21 263169
22 269312
23 4194304
24 4194306
25 4477456
26 4493312
27 4498641
28 4498752
29 268435456
30 268437200
31 1073741824
32 1073741830
33 1088472064
34 1089142784
35 1107225625

List of values

[1, 2, 4, 6, 16, 18, 64, 66, 100, 112, 1024, 1035, 4096, 4288, 4624, 4632, 65536, 65572, 262144, 262192, 263169, 269312, 4194304, 4194306, 4477456, 4493312, 4498641, 4498752, 268435456, 268437200, 1073741824, 1073741830, 1088472064, 1089142784, 1107225625]