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.

A051010 Triangle T(m,n) giving of number of steps in the Euclidean algorithm for gcd(m,n) with 0<=m

Table of values

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

List of values

[0, 0, 1, 0, 1, 2, 0, 1, 1, 2, 0, 1, 2, 3, 2, 0, 1, 1, 1, 2, 2, 0, 1, 2, 2, 3, 3, 2, 0, 1, 1, 3, 1, 4, 2, 2, 0, 1, 2, 1, 2, 3, 2, 3, 2, 0, 1, 1, 2, 2, 1, 3, 3, 2, 2, 0, 1, 2, 3, 3, 2, 3, 4, 4, 3, 2, 0, 1, 1, 1, 1, 3, 1, 4, 2, 2, 2, 2, 0, 1, 2, 2, 2, 4, 2, 3, 5, 3, 3, 3, 2, 0, 1, 1, 3, 2, 3, 2, 1, 3, 4, 3]