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.

A348340 For n >= 1; x = n, then iterate x --> x + h(x) until h(x + h(x)) >= h(x). a(n) gives the number of iteration steps where h(i) is A000120(i).

Table of values

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

List of values

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