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.

A262907 a(n) = number of steps needed to reach a fixed point when starting with k = n, and repeatedly replacing k with k - A262904(k).

Table of values

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

List of values

[0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 4, 6, 5, 7, 6, 8, 7, 6, 8, 7, 9, 8, 8, 9, 8, 10, 8, 11, 9, 12, 10, 13, 12, 14, 9, 15, 13, 16, 13, 17, 15, 13, 16, 14, 16, 15, 14, 16, 14, 17, 18, 18, 16, 19, 17, 20, 18, 21, 17, 22, 15, 23, 18, 24, 22, 25, 20, 26, 21, 27, 19, 28, 23, 16, 16, 19, 28, 23, 23, 21, 27, 22, 27, 20, 20, 24, 20, 17, 23, 29, 29, 24, 22, 28, 24, 28, 30, 21]