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.

A364882 a(1)=1 and thereafter a(n) is the number of locations 1..n-1 which are visited last in a single path beginning at some location s, 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 3
6 3
7 3
8 4
9 6
10 6
11 7
12 7
13 7
14 7
15 7
16 7
17 9
18 9
19 9
20 11
21 11
22 11
23 14
24 15
25 15
26 15
27 15
28 17
29 18
30 18
31 18
32 19
33 19
34 25
35 25
36 25
37 25
38 26
39 26
40 26
41 26
42 26
43 27
44 27
45 27
46 28
47 28
48 28
49 28
50 29
51 29
52 29
53 29
54 29
55 29
56 29
57 29
58 29
59 29
60 29
61 29
62 29
63 30
64 30
65 30
66 30
67 30
68 30
69 40
70 40

List of values

[1, 1, 2, 3, 3, 3, 3, 4, 6, 6, 7, 7, 7, 7, 7, 7, 9, 9, 9, 11, 11, 11, 14, 15, 15, 15, 15, 17, 18, 18, 18, 19, 19, 25, 25, 25, 25, 26, 26, 26, 26, 26, 27, 27, 27, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 30, 30, 30, 30, 30, 30, 40, 40]