29216

Appears in sequences

• Number of biconnected triangle-free graphs on n nodes with chromatic number 3.at n=10A126756
• Triangle, read by rows, T(n, k) = 2*A123125(n-1, k), for n >= 2, otherwise T(n, 0) = T(n, n) = -1, with T(0, 0) = T(1, 0) = 1.at n=58A141591
• Triangle, read by rows, T(n, k) = 2*A123125(n-1, k), for n >= 2, otherwise T(n, 0) = T(n, n) = -1, with T(0, 0) = T(1, 0) = 1.at n=62A141591
• Coefficients of the derivatives of the Eulerian polynomials (with indexing as in A173018).at n=29A142706
• Triangle T(n, k) = f(n, k) + f(n, n-k), where f(n, k) = A008292(n*k + 1, n-k) if k <= n otherwise A008292(n*(n-k), k), read by rows.at n=12A157117
• Number of 4-step knight's tours on an (n+2) X (n+2) board summed over all starting positions.at n=9A186853
• Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3 or 5.at n=40A254830
• p-INVERT of (1,0,0,1,0,0,1,0,0,...), where p(S) = (1 - S^2).at n=30A289918
• p-INVERT of (1,0,1,0,0,0,0,...), where p(S) = (1 - S)(1 + S^2).at n=29A291741
• a(n) = Sum_{k=0..floor(n/2)} binomial(4*k,n-2*k).at n=15A375314
• Expansion of 1 / ((1-x)^2 - x^6).at n=27A392541