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.

A279047 Number k of modular reductions at which the recurrence relation x(i+1) = x(0) mod x(i) terminates with x(k) = 1, where x(0) = prime(n+1), x(1) = prime(n).

Table of values

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

List of values

[1, 2, 2, 4, 2, 2, 2, 4, 4, 2, 2, 2, 2, 4, 5, 6, 2, 2, 4, 2, 2, 4, 4, 2, 2, 2, 4, 2, 2, 2, 4, 4, 2, 5, 2, 2, 2, 4, 5, 6, 2, 2, 2, 2, 2, 3, 4, 4, 2, 2, 6, 2, 2, 4, 5, 4, 2, 2, 2, 2, 4, 5, 4, 2, 2, 5, 2, 6, 2, 2, 6, 4, 2, 2, 4, 4, 4, 2, 2, 7, 2, 2, 2, 2, 4, 4, 2, 2, 2, 4, 8, 5, 4, 3, 4, 4, 3, 2, 2, 2, 4, 5, 4, 2, 2, 6, 5, 6]