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.

A209281 Start with first run [0,1] then, for n >= 2, the n-th run has length 2^n and is the concatenation of [a(1),a(2),...,a(2^n/2)] and [n-a(1),n-a(2),...,n-a(2^n/2)].

Table of values

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

List of values

[0, 1, 2, 1, 3, 2, 1, 2, 4, 3, 2, 3, 1, 2, 3, 2, 5, 4, 3, 4, 2, 3, 4, 3, 1, 2, 3, 2, 4, 3, 2, 3, 6, 5, 4, 5, 3, 4, 5, 4, 2, 3, 4, 3, 5, 4, 3, 4, 1, 2, 3, 2, 4, 3, 2, 3, 5, 4, 3, 4, 2, 3, 4, 3, 7, 6, 5, 6, 4, 5, 6, 5, 3, 4, 5, 4, 6, 5, 4, 5, 2, 3, 4, 3, 5, 4, 3]