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.

A300234 a(n) = number of steps in simple Euclidean algorithm for gcd(n,k) to reach the termination test n=k when starting with n = n and k = phi(n).

Table of values

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

List of values

[0, 1, 2, 1, 4, 2, 6, 1, 2, 3, 10, 2, 12, 4, 8, 1, 16, 2, 18, 3, 4, 6, 22, 2, 4, 7, 2, 4, 28, 6, 30, 1, 9, 9, 9, 2, 36, 10, 5, 3, 40, 4, 42, 6, 8, 12, 46, 2, 6, 3, 10, 7, 52, 2, 5, 4, 6, 15, 58, 6, 60, 16, 4, 1, 10, 8, 66, 9, 11, 13, 70, 2, 72, 19, 8, 10, 13, 6, 78, 3, 2, 21, 82, 4, 24, 22, 12, 6, 88, 6, 11, 12, 8, 24, 13, 2, 96, 4, 9, 3, 100, 10, 102, 7, 9]