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.

A321696 For any sequence f of positive integers, let g(f) be the unique Golomb-like sequence with run lengths given by f and let k(f) be the unique Kolakoski-like sequence with run lengths given by f and initial term 1; this sequence is the unique sequence f satisfying f = k(g(f)).

Table of values

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

List of values

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