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.

A360595 a(n) is the maximum number of locations 1..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 1..n-1) and a term can be visited up to three times.

Table of values

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

List of values

[0, 3, 1, 2, 2, 12, 1, 2, 2, 4, 2, 10, 15, 1, 2, 2, 4, 2, 10, 20, 1, 2, 2, 4, 2, 10, 13, 8, 2, 10, 2, 15, 7, 15, 25, 17, 53, 1, 2, 2, 4, 2, 10, 65, 1, 2, 2, 4, 2, 10, 13, 8, 2, 10, 2, 15, 7, 15, 72, 1, 2, 2, 4, 2, 10, 24, 18, 52]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.