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.

A347682 Array read by antidiagonals: T(n,k) (n>=1, k>=1) = f(prime(n),prime(k)), where f(x,y) = x*red_inv(x,y) + y*red_inv(y,x) if gcd(x,y)=1, or 0 if gcd(x,y)>1, and red_inv is defined in the comments.

Table of values

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

List of values

[0, 5, 5, 9, 0, 9, 13, 11, 11, 13, 21, 13, 0, 13, 21, 25, 23, 29, 29, 23, 25, 33, 25, 21, 0, 21, 25, 33, 37, 35, 51, 43, 43, 51, 35, 37, 45, 37, 69, 27, 0, 27, 69, 37, 45, 57, 47, 39, 69, 131, 131, 69, 39, 47, 57, 61, 59, 91, 113, 67, 0, 67, 113, 91, 59, 61, 73, 61, 59, 139, 153, 103, 103, 153, 139, 59, 61, 73]