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.

A360745 a(n) is the maximum number of locations 1..n-1 which can be reached starting from a(1)=1, where jumps from location i to i +- a(i) are permitted (within 1..n-1). See example.

Table of values

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

List of values

[1, 1, 2, 3, 3, 4, 4, 4, 7, 7, 7, 8, 9, 9, 9, 9, 9, 9, 12, 12, 13, 13, 13, 13, 13, 14, 14, 17, 17, 17, 17, 17, 24, 24, 24, 25, 25, 26, 27, 27, 28, 29, 29, 29, 29, 29, 29, 29, 29, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 33, 33, 33, 34, 34, 37, 37, 37, 38, 38, 48, 48, 48, 48, 48, 49, 50, 51, 52, 53, 53, 53]