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.

A091136 Smallest number m such that number of times m divides k! is almost k/n for large k, i.e., smallest m with A090624(m)=n.

Table of values

n a(n)
0 1
1 2
2 3
3 8
4 5
5 32
6 7
7 128
8 25
9 512
10 11
11 2048
12 13
13 8192
14 2187
15 32768
16 17
17 131072
18 19
19 524288
20 121
21 2097152
22 23
23 8388608
24 169
25 33554432
26 1594323
27 134217728
28 29
29 536870912
30 31
31 2147483648
32 289
33 8589934592
34 129140163
35 34359738368
36 37

List of values

[1, 2, 3, 8, 5, 32, 7, 128, 25, 512, 11, 2048, 13, 8192, 2187, 32768, 17, 131072, 19, 524288, 121, 2097152, 23, 8388608, 169, 33554432, 1594323, 134217728, 29, 536870912, 31, 2147483648, 289, 8589934592, 129140163, 34359738368, 37]