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.

A293843 Split the infinite binary word A030302, from left to right, into the largest possible cubefree chunks; a(n) = length of n-th cubefree chunk.

Table of values

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

List of values

[5, 7, 4, 4, 10, 3, 9, 5, 2, 3, 5, 12, 9, 10, 2, 3, 7, 9, 2, 5, 4, 2, 4, 2, 4, 2, 4, 6, 6, 3, 8, 15, 6, 12, 5, 2, 14, 2, 6, 2, 4, 6, 3, 11, 13, 8, 2, 2, 4, 3, 5, 7, 4, 2, 6, 5, 2, 5, 2, 2, 3, 2, 5, 2, 5, 7, 4, 3, 7, 7, 7, 3, 7, 15, 7, 19, 7, 2, 5, 7, 11, 5, 5]