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.

A121561 The number of iterations of "subtract the largest prime less than or equal to the current value" to go from n to the limiting value 0 or 1.

Table of values

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

List of values

[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, 2, 1, 1, 1, 1, 2]