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.

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

Table of values

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

List of values

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