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.

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

List of values

[1, 1, 2, 3, 4, 4, 5, 5, 5, 7, 8, 8, 8, 9, 9, 12, 10, 10, 12, 10, 12, 13, 13, 13, 16, 14, 14, 16, 17, 17, 17, 18, 18, 24, 25, 25, 25, 26, 27, 27, 27, 27, 28, 28, 30, 28, 33, 28, 29, 30, 30, 30, 33, 31, 31, 31, 32, 32, 33, 33, 31, 31, 32, 33, 33, 35, 33, 37]

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

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