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.

A362746 a(1)=a(2)=1; a(n)=The count of all occurrences in the list so far where integer a(n-1) appears adjacent to integer a(n-2).

Table of values

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

List of values

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