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.

A275463 Least k such that n divides d(k*n) (d = A000005).

Table of values

n a(n)
1 1
2 1
3 3
4 2
5 16
6 2
7 64
8 3
9 4
10 8
11 1024
12 5
13 4096
14 32
15 48
16 24
17 65536
18 10
19 262144
20 12
21 192
22 512
23 4194304
24 15
25 400
26 2048
27 900
28 48
29 268435456
30 24
31 1073741824
32 60
33 3072
34 32768
35 5184
36 35
37 68719476736
38 131072
39 12288
40 42
41 1099511627776
42 96
43 4398046511104

List of values

[1, 1, 3, 2, 16, 2, 64, 3, 4, 8, 1024, 5, 4096, 32, 48, 24, 65536, 10, 262144, 12, 192, 512, 4194304, 15, 400, 2048, 900, 48, 268435456, 24, 1073741824, 60, 3072, 32768, 5184, 35, 68719476736, 131072, 12288, 42, 1099511627776, 96, 4398046511104]