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.

A360594 a(n) is the maximum number of locations 0..n-1 which can be visited in a single path starting from i=n-1, where jumps from location i to i +- a(i) are permitted (within 0..n-1) and each location can be visited up to 2 times.

Table of values

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

List of values

[0, 2, 1, 2, 4, 3, 8, 1, 2, 2, 4, 2, 8, 5, 4, 6, 13, 14, 14, 13, 13, 16, 22, 3, 17, 16, 20, 13, 13, 24, 22, 15, 24, 15, 14, 17, 14, 4, 15, 18, 23, 26, 28, 13, 16, 30, 28, 14, 15, 17, 16, 19, 16, 33, 18, 33, 32, 35, 39, 38, 40, 38, 39, 39, 36, 39, 38, 39, 41, 52]