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.

A072030 Array read by antidiagonals: T(n,k) = number of steps in simple Euclidean algorithm for gcd(n,k) where n >= 1, k >= 1.

Table of values

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

List of values

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