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.

A289251 Triangle T(n, k), n > 0 and 0 <= k < n, read by rows; if gcd(n, k) = 1, then T(n, k) = modular inverse of k (mod n), otherwise T(n, k) = k.

Table of values

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

List of values

[0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 1, 3, 2, 4, 0, 1, 2, 3, 4, 5, 0, 1, 4, 5, 2, 3, 6, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 5, 3, 7, 2, 6, 4, 8, 0, 1, 2, 7, 4, 5, 6, 3, 8, 9, 0, 1, 6, 4, 3, 9, 2, 8, 7, 5, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 7, 9, 10, 8, 11]