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.

A228247 Number of primitive solutions of t(x,n) - s(x,n) = 2, where s(x,n) and t(x,n) are the number of applications of the classical and modified Euclidean algorithms needed to convert (x,n) to gcd(x,n).

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 1, 2, 1, 1, 2, 1, 3, 2, 0, 2, 5, 2, 1, 4, 2, 3, 4, 1, 5, 3, 4, 6, 5, 1, 1, 6, 5, 4, 4, 3, 7, 8, 1, 7, 9, 4, 5, 6, 4, 5, 6, 6, 10, 6, 5, 6, 8, 4, 7, 9, 7, 7, 8, 6, 6, 12, 10, 10, 11, 3, 5, 7, 8, 11, 6, 11, 13, 10, 4, 7, 15]