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.

A369475 Lexicographically earliest infinite sequence such that, from all indices n with the same a(n) value, the terms reached by a single jump are all distinct, where jumps are allowed from location i to i+-a(i).

Table of values

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

List of values

[1, 2, 2, 3, 4, 1, 5, 3, 2, 5, 6, 1, 7, 4, 6, 3, 1, 8, 8, 2, 5, 7, 3, 5, 6, 9, 1, 10, 11, 1, 12, 3, 2, 3, 10, 4, 13, 1, 14, 6, 2, 3, 9, 5, 15, 7, 2, 9, 13, 7, 5, 4, 4, 4, 6, 10, 12, 11, 9, 2, 10, 16, 1, 15, 3, 4, 5, 17, 1, 18, 9, 12, 3, 6, 5, 19, 1, 20, 9, 15]