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.

A347735 Square array T(n, k), n, k > 0, read by antidiagonals; let b be the function that associates to any pair of integers (u, v) the Bézout coefficients (x, y) as produced by the extended Euclidean algorithm (u*x + v*y = gcd(u, v)); T(n, k) is the number of iterations of b when starting from (n, k) needed to obtain a unit vector.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 1]