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.

A167408 Orderly numbers: a number n is orderly if there exists some number k > tau(n) such that the set of the divisors of n is congruent to the set {1,2,...,tau(n)} mod k.

Table of values

n a(n)
1 1
2 2
3 5
4 7
5 8
6 9
7 11
8 12
9 13
10 17
11 19
12 20
13 23
14 27
15 29
16 31
17 37
18 38
19 41
20 43
21 47
22 52
23 53
24 57
25 58
26 59
27 61
28 67
29 68
30 71
31 72
32 73
33 76
34 79
35 83
36 87
37 89
38 97
39 101
40 103
41 107
42 109
43 113
44 117
45 118
46 124
47 127
48 131
49 133
50 137
51 139
52 149
53 151
54 157
55 158
56 162
57 163
58 164
59 167
60 173
61 177
62 178
63 179

List of values

[1, 2, 5, 7, 8, 9, 11, 12, 13, 17, 19, 20, 23, 27, 29, 31, 37, 38, 41, 43, 47, 52, 53, 57, 58, 59, 61, 67, 68, 71, 72, 73, 76, 79, 83, 87, 89, 97, 101, 103, 107, 109, 113, 117, 118, 124, 127, 131, 133, 137, 139, 149, 151, 157, 158, 162, 163, 164, 167, 173, 177, 178, 179]