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.

A076932 Largest k such that n*k has n divisors, or 0 if there are no possibilities for k or infinitely many.

Table of values

n a(n)
1 1
2 1
3 3
4 2
5 125
6 3
7 16807
8 0
9 0
10 125
11 2357947691
12 0
13 1792160394037
14 16807
15 375
16 0
17 2862423051509815793
18 0
19 5480386857784802185939
20 0
21 50421
22 2357947691
23 39471584120695485887249589623
24 0
25 0
26 1792160394037
27 0
28 0

List of values

[1, 1, 3, 2, 125, 3, 16807, 0, 0, 125, 2357947691, 0, 1792160394037, 16807, 375, 0, 2862423051509815793, 0, 5480386857784802185939, 0, 50421, 2357947691, 39471584120695485887249589623, 0, 0, 1792160394037, 0, 0]