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.

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

List of values

[1, 1, 2, 3, 1, 5, 6, 7, 1, 1, 2, 11, 1, 13, 14, 15, 1, 1, 2, 3, 1, 5, 6, 23, 1, 1, 2, 27, 1, 29, 30, 31, 1, 1, 2, 3, 1, 5, 6, 7, 1, 1, 2, 11, 1, 13, 14, 47, 1, 1, 2, 3, 1, 5, 6, 55, 1, 1, 2, 59, 1, 61, 62, 63, 1, 1, 2, 3, 1, 5, 6, 7, 1, 1, 2, 11, 1, 13, 14, 15]