A367954 - cp's OEIS frontend

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

n	a(n)
1	0
2	2
3	7
4	14
5	26
6	38
7	57
8	78
9	102
10	128
11	165
12	196
13	240
14	284
15	329
16	378
17	440
18	498
19	571
20	634
21	704
22	780
23	875
24	952
25	1044
26	1142
27	1243
28	1342
29	1466
30	1566
31	1697
32	1818
33	1946
34	2084
35	2219
36	2346
37	2506
38	2662
39	2823
40	2972
41	3158
42	3312
43	3509
44	3684
45	3860
46	4056
47	4279
48	4464
49	4676

[0, 2, 7, 14, 26, 38, 57, 78, 102, 128, 165, 196, 240, 284, 329, 378, 440, 498, 571, 634, 704, 780, 875, 952, 1044, 1142, 1243, 1342, 1466, 1566, 1697, 1818, 1946, 2084, 2219, 2346, 2506, 2662, 2823, 2972, 3158, 3312, 3509, 3684, 3860, 4056, 4279, 4464, 4676]

cp's OEIS Frontend

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

Table of values

List of values