1492908
domain: N
Appears in sequences
- Number of 5-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=5.at n=22A027560
- G.f. A(x) satisfies: A(x)^2 + A(-x)^2 = 2 and A(x)^-2 - A(-x)^-2 = -8*x.at n=9A193618
- G.f.: sqrt( (1 + sqrt(1+8*x)) / (1 + sqrt(1-8*x)) ).at n=9A246062