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.

A094004 a(n) = (conjectured) length of longest string that can be generated by a starting string of 2's and 3's of length n, using the rule described in the Comments lines.

Table of values

n a(n)
1 1
2 4
3 5
4 8
5 9
6 14
7 15
8 66
9 68
10 70
11 123
12 124
13 125
14 132
15 133
16 134
17 135
18 136
19 138
20 139
21 140
22 142
23 143
24 144
25 145
26 146
27 147
28 148
29 149
30 150
31 151
32 152
33 153
34 154
35 155
36 156
37 157
38 158
39 159
40 160
41 161
42 162
43 163
44 164
45 165
46 166
47 167
48 179
49 180
50 181
51 182
52 183
53 184
54 185
55 186
56 187
57 188
58 189
59 190
60 191
61 192
62 193
63 194
64 195
65 196
66 197
67 198
68 200
69 201
70 202
71 203
72 204
73 205
74 206
75 207
76 209
77 250
78 251
79 252
80 253

List of values

[1, 4, 5, 8, 9, 14, 15, 66, 68, 70, 123, 124, 125, 132, 133, 134, 135, 136, 138, 139, 140, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 200, 201, 202, 203, 204, 205, 206, 207, 209, 250, 251, 252, 253]