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.

A300228 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 = 1+phi(n).

Table of values

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

List of values

[1, 0, 0, 3, 0, 1, 0, 4, 5, 1, 0, 5, 0, 1, 3, 6, 0, 6, 0, 7, 6, 1, 0, 4, 9, 1, 7, 9, 0, 5, 0, 10, 5, 1, 4, 8, 0, 1, 8, 9, 0, 9, 0, 13, 5, 1, 0, 9, 13, 8, 7, 15, 0, 10, 16, 11, 10, 1, 0, 12, 0, 1, 9, 18, 19, 9, 0, 19, 9, 6, 0, 12, 0, 1, 12, 21, 11, 13, 0, 10, 13, 1, 0, 10, 7, 1, 11, 13, 0, 6, 22, 25, 14, 1, 13, 12, 0, 10, 12, 10, 0, 13, 0, 15, 8]