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.

A082691 a(1)=1, a(2)=2, then if the first 3*2^k-1 terms are a(1), a(2), ..., a(3*2^k - 1), the first 3*2^(k+1)-1 terms are a(1), a(2), ..., a(3*2^k - 1), a(1), a(2), ..., a(3*2^k - 1), a(3*2^k-1) + 1.

Table of values

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

List of values

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