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.

A175078 Number of iterations of {r mod (max prime p < r)} needed to reach 1 or 2 starting at r = n.

Table of values

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

List of values

[0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2]