A367892 - cp's OEIS frontend

A367892 Total number of steps of Euclid's GCD algorithm to calculate gcd(x,y) for all pairs x,y in the range 1 <= y <= x <= n.

n	a(n)
1	1
2	3
3	7
4	12
5	21
6	29
7	43
8	58
9	75
10	93
11	121
12	142
13	175
14	207
15	239
16	274
17	321
18	363
19	419
20	464
21	515
22	571
23	645
24	700
25	769
26	843
27	919
28	992
29	1089
30	1161
31	1263
32	1354
33	1451
34	1557
35	1659
36	1752
37	1877
38	1997
39	2121
40	2232
41	2379
42	2493
43	2649
44	2782
45	2915
46	3067
47	3245
48	3384
49	3549

[1, 3, 7, 12, 21, 29, 43, 58, 75, 93, 121, 142, 175, 207, 239, 274, 321, 363, 419, 464, 515, 571, 645, 700, 769, 843, 919, 992, 1089, 1161, 1263, 1354, 1451, 1557, 1659, 1752, 1877, 1997, 2121, 2232, 2379, 2493, 2649, 2782, 2915, 3067, 3245, 3384, 3549]

cp's OEIS Frontend

A367892 Total number of steps of Euclid's GCD algorithm to calculate gcd(x,y) for all pairs x,y in the range 1 <= y <= x <= n.

Table of values

List of values