51504

Appears in sequences

• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A001950 (upper Wythoff sequence).at n=24A024475
• Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 11011-01110 pattern in any orientation.at n=12A147226
• Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 11011-01110 pattern in any orientation.at n=27A147228
• Number of line segments connecting exactly 4 points in an n x n grid of points.at n=34A177720
• T(n,k) = Number of n-step self-avoiding walks on a k X k X k cube summed over all starting positions.at n=41A187162
• Number of 6-step self-avoiding walks on an n X n X n cube summed over all starting positions.at n=3A187167
• Triangle read by rows: T(n,k) = number of ways to place k nonattacking kings on an n X n board.at n=32A193580
• Number of ways to place 7 nonattacking kings on an n X n board.at n=5A194788
• Number of binary words of length n that avoid abelian 4th powers circularly.at n=36A334831
• G.f. A(x) satisfies A(x) = ( 1 + x * A(x)^(2/3) * (1 + A(x)^(2/3)) )^3.at n=5A378155
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0^n and T(n,k) = k * Sum_{r=0..n} binomial(n,r) * binomial(2*n+2*r+k,n)/(2*n+2*r+k) for k > 0.at n=41A378239