A027557 - cp's OEIS frontend

A027557 Number of 3-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=3.

n	a(n)
0	1
1	2
2	4
3	8
4	14
5	26
6	44
7	78
8	130
9	224
10	370
11	626
12	1028
13	1718
14	2810
15	4656
16	7594
17	12506
18	20356
19	33374
20	54242
21	88640
22	143906
23	234594
24	380548
25	619238
26	1003882
27	1631312
28	2643386
29	4291082
30	6950852
31	11274702
32	18258322
33	29598560

[1, 2, 4, 8, 14, 26, 44, 78, 130, 224, 370, 626, 1028, 1718, 2810, 4656, 7594, 12506, 20356, 33374, 54242, 88640, 143906, 234594, 380548, 619238, 1003882, 1631312, 2643386, 4291082, 6950852, 11274702, 18258322, 29598560]

cp's OEIS Frontend

A027557 Number of 3-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=3.

Table of values

List of values