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.

A324553 a(n) = the smallest number m such that gcd(m, tau(m)) = n where tau(k) = the number of the divisors of k (A000005).

Table of values

n a(n)
1 1
2 2
3 9
4 8
5 400
6 12
7 3136
8 24
9 36
10 80
11 123904
12 60
13 692224
14 448
15 2025
16 384
17 18939904
18 180
19 94633984
20 240
21 35721
22 11264
23 2218786816
24 360
25 10000
26 53248
27 26244
28 1344
29 225754218496
30 720
31 1031865892864
32 1920
33 7144929
34 1114112
35 1960000
36 1260
37 94076963651584
38 4980736
39 56070144
40 1680
41 1848279046291456
42 4032
43 8131987999031296
44 33792
45 3600
46 96468992
47 155444555888459776
48 3360
49 7529536
50 30000

List of values

[1, 2, 9, 8, 400, 12, 3136, 24, 36, 80, 123904, 60, 692224, 448, 2025, 384, 18939904, 180, 94633984, 240, 35721, 11264, 2218786816, 360, 10000, 53248, 26244, 1344, 225754218496, 720, 1031865892864, 1920, 7144929, 1114112, 1960000, 1260, 94076963651584, 4980736, 56070144, 1680, 1848279046291456, 4032, 8131987999031296, 33792, 3600, 96468992, 155444555888459776, 3360, 7529536, 30000]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.