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.

A384183 a(n) = minimum number of steps required to move n stones from a hole to the next one in an infinite row of holes, where at one step we can move any k stones at once from a hole to the hole at distance k to the left or to the right, and there are n stones overall.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 4
5 5
6 5
7 6
8 7
9 7
10 6
11 7
12 7
13 8
14 7
15 7
16 8
17 9
18 8
19 8
20 9
21 8
22 8
23 9
24 8
25 9
26 8
27 9
28 9
29 10
30 9
31 9
32 10
33 9
34 9
35 9
36 10
37 10
38 9
39 10
40 9
41 10
42 9
43 10
44 10
45 10
46 10
47 10
48 10
49 10
50 10
51 10
52 11
53 11
54 10
55 10
56 10
57 10
58 10
59 11
60 10
61 11
62 10
63 11
64 11
65 10
66 11
67 11
68 11
69 11
70 11
71 11
72 11
73 11
74 10
75 11
76 11
77 11

List of values

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