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.

A383441 a(n) is the total of iterations needed in the binary GCD algorithm to compute gcd(n, k) for k = 0..n. The corresponding row of gcds is row n of A109004.

Table of values

n a(n)
0 0
1 0
2 0
3 2
4 1
5 5
6 5
7 12
8 5
9 11
10 12
11 23
12 13
13 29
14 27
15 31
16 17
17 38
18 26
19 47
20 31
21 42
22 51
23 70
24 35
25 63
26 64
27 72
28 62
29 96
30 69
31 104
32 49
33 80
34 84
35 86
36 64
37 123
38 103
39 118
40 77
41 130
42 94
43 152
44 115
45 128
46 151
47 174
48 90
49 163
50 138
51 164
52 144
53 197
54 157
55 188
56 144
57 187
58 206
59 229
60 157
61 251

List of values

[0, 0, 0, 2, 1, 5, 5, 12, 5, 11, 12, 23, 13, 29, 27, 31, 17, 38, 26, 47, 31, 42, 51, 70, 35, 63, 64, 72, 62, 96, 69, 104, 49, 80, 84, 86, 64, 123, 103, 118, 77, 130, 94, 152, 115, 128, 151, 174, 90, 163, 138, 164, 144, 197, 157, 188, 144, 187, 206, 229, 157, 251]