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.

A285721 Square array read by antidiagonals: A(n,k) = number of steps in simple Euclidean algorithm for gcd(n,k) to reach the termination test n=k, read by antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), etc.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 0
6 2
7 3
8 2
9 2
10 3
11 4
12 1
13 0
14 1
15 4
16 5
17 3
18 3
19 3
20 3
21 5
22 6
23 2
24 3
25 0
26 3
27 2
28 6
29 7
30 4
31 1
32 4
33 4
34 1
35 4
36 7
37 8
38 3
39 4
40 2
41 0
42 2
43 4
44 3
45 8
46 9
47 5
48 4
49 4
50 5
51 5
52 4
53 4
54 5
55 9
56 10
57 4
58 2
59 1
60 4
61 0
62 4
63 1
64 2
65 4
66 10
67 11
68 6
69 5
70 5
71 4
72 6
73 6
74 4
75 5
76 5
77 6
78 11
79 12
80 5
81 5
82 3
83 5
84 3
85 0
86 3
87 5
88 3
89 5
90 5
91 12
92 13
93 7
94 3
95 5
96 1
97 2
98 7
99 7
100 2
101 1
102 5
103 3
104 7
105 13
106 14
107 6
108 6
109 2
110 6
111 3
112 5
113 0
114 5
115 3
116 6
117 2
118 6
119 6
120 14

List of values

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