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.

A049769 Triangular array T read by rows: T(n,k) = (k^3 mod n) + (n^3 mod k).

Table of values

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

List of values

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