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.

A167234 Smallest number such that no two divisors of n are congruent modulo a(n).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 3
6 6
7 4
8 5
9 5
10 6
11 3
12 7
13 5
14 8
15 8
16 9
17 3
18 10
19 4
20 7
21 8
22 6
23 3
24 13
25 7
26 7
27 5
28 11
29 3
30 11
31 4
32 9
33 7
34 6
35 8
36 13
37 5
38 5
39 7
40 11
41 3
42 16
43 4
44 12
45 13
46 6
47 3
48 17
49 5
50 11
51 9
52 7
53 3
54 10
55 7
56 15
57 5
58 5
59 3
60 21
61 7
62 7
63 11
64 11
65 7
66 14
67 4
68 7
69 7
70 16
71 3
72 13
73 5
74 10
75 13
76 7
77 8
78 14
79 4
80 17
81 7
82 6
83 3
84 23
85 9
86 8
87 5
88 13
89 3
90 19
91 8
92 12

List of values

[1, 2, 3, 4, 3, 6, 4, 5, 5, 6, 3, 7, 5, 8, 8, 9, 3, 10, 4, 7, 8, 6, 3, 13, 7, 7, 5, 11, 3, 11, 4, 9, 7, 6, 8, 13, 5, 5, 7, 11, 3, 16, 4, 12, 13, 6, 3, 17, 5, 11, 9, 7, 3, 10, 7, 15, 5, 5, 3, 21, 7, 7, 11, 11, 7, 14, 4, 7, 7, 16, 3, 13, 5, 10, 13, 7, 8, 14, 4, 17, 7, 6, 3, 23, 9, 8, 5, 13, 3, 19, 8, 12]