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.

A049767 Triangular array T, read by rows: T(n,k) = (k^2 mod n) + (n^2 mod k), for k = 1..n and n >= 1.

Table of values

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

List of values

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