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.

A276044 Least k such that phi(k) has exactly n divisors.

Table of values

n a(n)
1 1
2 3
3 5
4 7
5 17
6 13
7 85
8 31
9 37
10 65
11 1285
12 61
13 4369
14 193
15 185
16 143
17 65537
18 181
19 327685
20 241
21 577
22 3281
23 5570645
24 403
25 1297
26 12289
27 1057
28 1037
29 286331153
30 779
31 1431655765
32 899
33 9509
34 197633
35 5629
36 1333
37 137438953472
38 786433
39 42653
40 1763
41 2199023255552
42 2993
43 8796093022208
44 15361
45 3737
46 12648641

List of values

[1, 3, 5, 7, 17, 13, 85, 31, 37, 65, 1285, 61, 4369, 193, 185, 143, 65537, 181, 327685, 241, 577, 3281, 5570645, 403, 1297, 12289, 1057, 1037, 286331153, 779, 1431655765, 899, 9509, 197633, 5629, 1333, 137438953472, 786433, 42653, 1763, 2199023255552, 2993, 8796093022208, 15361, 3737, 12648641]

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

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