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.

A167401 a(n) is the smallest number k such that n*k has twice as many divisors as k.

Table of values

n a(n)
2 1
3 1
4 2
5 1
6 12
7 1
8 4
9 3
10 20
11 1
12 72
13 1
14 28
15 45
16 8
17 1
18 108
19 1
20 160
21 63
22 44
23 1
24 288
25 5
26 52
27 9
28 224
29 1
30 10800
31 1
32 16
33 99
34 68
35 175
36 864
37 1
38 76
39 117
40 800
41 1
42 21168
43 1
44 352
45 675
46 92
47 1
48 1152
49 7
50 400
51 153
52 416
53 1
54 648
55 275
56 1568
57 171
58 116
59 1
60 259200

List of values

[1, 1, 2, 1, 12, 1, 4, 3, 20, 1, 72, 1, 28, 45, 8, 1, 108, 1, 160, 63, 44, 1, 288, 5, 52, 9, 224, 1, 10800, 1, 16, 99, 68, 175, 864, 1, 76, 117, 800, 1, 21168, 1, 352, 675, 92, 1, 1152, 7, 400, 153, 416, 1, 648, 275, 1568, 171, 116, 1, 259200]