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.

A006345 Linus sequence: a(n) "breaks the pattern" by avoiding the longest doubled suffix.

Table of values

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

List of values

[1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 2, 1, 2, 2, 1, 1, 2, 2, 2, 1, 2]