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.

A337942 Table read by antidiagonals: T(n, k) is the least positive m such that (m*n) mod k = (m*k) mod n, with n > 0 and k > 0.

Table of values

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

List of values

[1, 2, 2, 3, 1, 3, 4, 5, 5, 4, 5, 2, 1, 2, 5, 6, 3, 2, 2, 3, 6, 7, 3, 2, 1, 2, 3, 7, 8, 11, 2, 7, 7, 2, 11, 8, 9, 4, 17, 5, 1, 5, 17, 4, 9, 10, 5, 11, 13, 3, 3, 13, 11, 5, 10, 11, 5, 3, 2, 3, 1, 3, 2, 3, 5, 11, 12, 17, 7, 3, 28, 10, 10, 28, 3, 7, 17, 12]