133556

Appears in sequences

• Triangle T(n,m), [x*A(x)]^m=sum(n>=m T(n,m)*x^n), where A(x) satisfies x*A(x)^2= -(2*x*A(x)+sqrt(1-4*x*A(x))-1)/(4*x*A(x)+sqrt(1-4*x*A(x))-1).at n=21A188109
• Number of n X n 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column or nw-se diagonal.at n=2A207473
• Number of nX3 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column or nw-se diagonal.at n=2A207474
• T(n,k)=Number of nXk 0..3 arrays avoiding the patterns z z+1 z or z z-1 z in any row, column or nw-se diagonal.at n=12A207479
• Number of length n+2 0..n arrays with no three unequal elements in a row and new values 0..n introduced in 0..n order.at n=11A243634
• Number of length n+2 0..7 arrays with no three unequal elements in a row and new values 0..7 introduced in 0..7 order.at n=11A243638
• Number of length n+2 0..8 arrays with no three unequal elements in a row and new values 0..8 introduced in 0..8 order.at n=11A243639
• Number of length n+2 0..9 arrays with no three unequal elements in a row and new values 0..9 introduced in 0..9 order.at n=11A243640
• The number of ways to write an n-bit binary string and then define each run of ones as an element in an equivalence relation.at n=13A247100
• G.f. A(x) satisfies: A(x) = 1/(1 - 2*x*A(x) - x*A(x)/(1 - x*A(x)/(1 - x*A(x)/(1 - ...)))), a continued fraction.at n=6A307489