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.

A307092 a(n) is the minimum number of iterations of the form x -> x + x^j (where j is a nonnegative integer and need not be identical in each iteration) required to reach n starting from 1.

Table of values

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

List of values

[0, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 4, 5, 4, 5, 2, 3, 3, 4, 4, 5, 4, 5, 5, 6, 5, 6, 3, 4, 5, 6, 2, 3, 3, 4, 4, 5, 4, 5, 3, 4, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8, 4, 5, 6, 7, 4, 5, 5, 6, 6, 7, 2, 3, 3, 4, 4, 5, 4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 3, 4, 5, 6, 6, 7, 5, 6, 7, 8, 8, 9, 6, 7, 7, 8, 7]