A094604 - cp's OEIS frontend

A094604 Largest number (up to that point) of consecutive rightmost black cells in the rows of Rule 30 (begun from an initial black cell). a(n) = b(2^n), where b(m) is sequence A094603.

n	a(n)
0	1
1	3
2	4
3	6
4	7
5	9
6	15
7	16
8	24
9	25
10	27
11	29
12	34
13	36
14	37
15	39
16	41
17	43
18	48
19	49
20	51
21	54
22	55
23	58
24	60
25	63
26	64
27	66
28	69
29	70
30	72
31	74
32	77
33	79
34	80
35	82
36	84
37	86
38	90
39	91
40	93
41	100
42	103
43	104
44	106
45	108
46	111

[1, 3, 4, 6, 7, 9, 15, 16, 24, 25, 27, 29, 34, 36, 37, 39, 41, 43, 48, 49, 51, 54, 55, 58, 60, 63, 64, 66, 69, 70, 72, 74, 77, 79, 80, 82, 84, 86, 90, 91, 93, 100, 103, 104, 106, 108, 111]

cp's OEIS Frontend

A094604 Largest number (up to that point) of consecutive rightmost black cells in the rows of Rule 30 (begun from an initial black cell). a(n) = b(2^n), where b(m) is sequence A094603.

Table of values

List of values

n	a(n)
0	1
1	3
2	4
3	6
4	7
5	9
6	15
7	16
8	24
9	25
10	27
11	29
12	34
13	36
14	37
15	39
16	41
17	43
18	48
19	49
20	51
21	54
22	55
23	58
24	60
25	63
26	64
27	66
28	69
29	70
30	72
31	74
32	77
33	79
34	80
35	82
36	84
37	86
38	90
39	91
40	93
41	100
42	103
43	104
44	106
45	108
46	111

n	a(n)
0	1
1	3
2	4
3	6
4	7
5	9
6	15
7	16
8	24
9	25
10	27
11	29
12	34
13	36
14	37
15	39
16	41
17	43
18	48
19	49
20	51
21	54
22	55
23	58
24	60
25	63
26	64
27	66
28	69
29	70
30	72
31	74
32	77
33	79
34	80
35	82
36	84
37	86
38	90
39	91
40	93
41	100
42	103
43	104
44	106
45	108
46	111

n	a(n)
0	1
1	3
2	4
3	6
4	7
5	9
6	15
7	16
8	24
9	25
10	27
11	29
12	34
13	36
14	37
15	39
16	41
17	43
18	48
19	49
20	51
21	54
22	55
23	58
24	60
25	63
26	64
27	66
28	69
29	70
30	72
31	74
32	77
33	79
34	80
35	82
36	84
37	86
38	90
39	91
40	93
41	100
42	103
43	104
44	106
45	108
46	111