558396domain: NAppears in sequencesG.f. satisfies: A(x) = Sum_{n>=0} (A(x)^n + 1)^n * x^n / (1+x)^(n+1).at n=9A251178Number of length n+6 0..1 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=27A256821