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.

A167409 Very orderly numbers: a number N is "very orderly" if the set of the divisors of N is congruent to the set {1,2,...,tau(N)} mod (tau(N) + 1).

Table of values

n a(n)
1 1
2 2
3 5
4 8
5 11
6 12
7 17
8 20
9 23
10 27
11 29
12 38
13 41
14 47
15 52
16 53
17 57
18 58
19 59
20 68
21 71
22 72
23 76
24 83
25 87
26 89
27 101
28 107
29 113
30 117
31 118
32 124
33 131
34 133
35 137
36 149
37 158
38 162
39 164
40 167
41 173
42 177
43 178
44 179
45 188
46 191
47 197
48 203
49 218
50 227
51 233
52 236
53 237
54 239
55 243
56 244
57 247
58 251
59 257

List of values

[1, 2, 5, 8, 11, 12, 17, 20, 23, 27, 29, 38, 41, 47, 52, 53, 57, 58, 59, 68, 71, 72, 76, 83, 87, 89, 101, 107, 113, 117, 118, 124, 131, 133, 137, 149, 158, 162, 164, 167, 173, 177, 178, 179, 188, 191, 197, 203, 218, 227, 233, 236, 237, 239, 243, 244, 247, 251, 257]