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.

A100035 a(n+1) occurs not earlier as a neighbor of terms = a(n): either it is the greatest number < a(n) or, if no such number exists, the smallest number > a(n); a(1) = 1.

Table of values

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

List of values

[1, 2, 3, 1, 4, 3, 5, 4, 2, 5, 1, 6, 5, 7, 6, 4, 7, 3, 6, 2, 7, 1, 8, 7, 9, 8, 6, 9, 5, 8, 4, 9, 3, 8, 2, 9, 1, 10, 9, 11, 10, 8, 11, 7, 10, 6, 11, 5, 10, 4, 11, 3, 10, 2, 11, 1, 12, 11, 13, 12, 10, 13, 9, 12, 8, 13, 7, 12, 6, 13, 5, 12, 4, 13, 3, 12, 2, 13, 1, 14, 13, 15, 14, 12, 15, 11, 14, 10]