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.

A094840 a(1) = 1; for n > 1, a(n) = curling number of (b(1),...,b(n-1)), where b() = Linus sequence A006345.

Table of values

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

List of values

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