687012domain: NAppears in sequencesNumber of length n+5 0..3 arrays with at most one downstep in every n consecutive neighbor pairs.at n=11A258735G.f. A(x) satisfies: 1 = Sum_{n>=0} x^n * ((1+x)^n - A(x))^(n+1), where A(0) = 0.at n=10A307940