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.

A364392 a(1)=1 and thereafter a(n) is the least number of locations 1..n-1 which can be visited in a single path beginning at i=n-1, in which one proceeds from location i to i +- a(i) (within 1..n-1) until no further unvisited location is available.

Table of values

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

List of values

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