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.

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

List of values

[1, 1, 2, 3, 3, 4, 5, 4, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 15, 16, 15, 16, 15, 18, 17, 18, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 22, 24, 22, 24, 23, 24, 26, 26, 26, 26, 26, 26, 26, 26, 26, 29, 32, 33, 35, 32, 35, 32, 35, 32, 35, 32, 35, 32, 36, 35, 37]