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.

A362890 a(1)=a(2)=1. For n>2, a(n) is the number of times that a(n-1) and a(n-2) are adjacent in the sequence thus far (in any order).

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 3, 1, 1, 3, 2, 2, 1, 4, 1, 2, 5, 1, 1, 4, 3, 1, 3, 4, 2, 1, 6, 1, 2, 7, 1, 1, 5, 2, 2, 2, 3, 3, 1, 5, 3, 1, 6, 3, 1, 7, 2, 2, 4, 2, 3, 4, 3, 4, 5, 1, 4, 4, 1, 5, 5, 1, 6, 4, 1, 6, 5, 1, 7, 3, 1, 8, 1, 2, 8, 1, 3, 9, 1, 1, 6, 6, 1, 7, 4, 1]