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.

A323733 Numbers k for which there exists at least one number j > 1 such that j^k has exactly j divisors.

Table of values

n a(n)
1 0
2 1
3 2
4 3
5 4
6 6
7 7
8 8
9 9
10 10
11 11
12 12
13 13
14 15
15 16
16 17
17 18
18 19
19 20
20 22
21 23
22 24
23 25
24 26
25 27
26 28
27 29
28 30
29 31
30 32
31 33
32 34
33 35
34 36
35 37
36 38
37 39
38 40
39 42
40 43
41 44
42 45
43 46
44 47
45 48
46 49
47 51
48 52
49 53
50 55
51 56
52 57
53 58
54 59
55 60
56 61
57 62
58 63
59 64
60 65
61 66
62 68
63 69
64 70
65 71
66 72
67 73

List of values

[0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 68, 69, 70, 71, 72, 73]

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

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