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.

A278744 Number of steps (modular reductions) in calculating the GCD of n-th consecutive primes p(n) and p(n+1) by the Euclidean algorithm.

Table of values

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

List of values

[1, 2, 2, 3, 2, 2, 2, 3, 3, 2, 2, 2, 2, 3, 3, 3, 2, 2, 3, 2, 2, 3, 3, 2, 2, 2, 3, 2, 2, 2, 3, 3, 2, 3, 2, 2, 2, 3, 3, 3, 2, 2, 2, 2, 2, 5, 5, 3, 2, 2, 3, 2, 2, 3, 3, 3, 2, 2, 2, 2, 3, 3, 3, 2, 2, 5, 2, 4, 2, 2, 3, 3, 2, 2, 3, 3, 5, 2, 2, 3, 2, 2, 2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 3, 4, 3, 3, 4, 2, 2, 2, 4, 3, 3, 2]