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.

A300227 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 = sigma(n)-1, with a(1) = 1.

Table of values

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

List of values

[1, 0, 0, 2, 0, 6, 0, 4, 3, 6, 0, 5, 0, 7, 9, 8, 0, 10, 0, 21, 12, 8, 0, 10, 5, 8, 6, 28, 0, 9, 0, 16, 9, 9, 14, 3, 0, 10, 9, 11, 0, 11, 0, 13, 11, 11, 0, 8, 7, 10, 10, 12, 0, 16, 10, 9, 10, 12, 0, 11, 0, 13, 11, 32, 10, 7, 0, 13, 13, 27, 0, 10, 0, 14, 8, 13, 11, 19, 0, 9, 15, 15, 0, 15, 13, 16, 11, 33, 0, 13, 12, 12, 11, 17, 27, 14, 0]