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.

A255326 a(n) gives the number of steps needed to reach zero, when we start from x = n and repeatedly subtract x's squarefree kernel (A007947(x)) from it.

Table of values

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

List of values

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