A377459 - cp's OEIS frontend

A377459 Square array T(n,k) read by ascending antidiagonals: number of steps for a certain Euclidean-style algorithm (see below) to find the GCD of n and k.

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

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

cp's OEIS Frontend

A377459 Square array T(n,k) read by ascending antidiagonals: number of steps for a certain Euclidean-style algorithm (see below) to find the GCD of n and k.

Table of values

List of values

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

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

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