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.

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

Table of values

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

List of values

[1, 1, 2, 3, 4, 5, 5, 6, 6, 7, 7, 9, 10, 10, 10, 11, 11, 13, 14, 14, 14, 15, 15, 15, 15, 21, 21, 21, 22, 22, 22, 23, 23, 23, 23, 24, 24, 26, 27, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 32, 32, 32, 32, 33, 33, 35, 35, 41, 42, 42, 42, 43, 43, 43, 44, 44, 45, 45, 46, 46, 46, 46, 46, 46, 47, 47, 49, 49, 51, 51, 51]