55715

Appears in sequences

• Number of solutions to c(1)t(1) + ... + c(n)t(n) = 0, where c(i) = +-1 for i>1, c(1) = t(1) = 1, t(i) = triangular numbers (A000217).at n=26A058498
• Number of nX3 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=7A208429
• T(n,k)=Number of nXk 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=47A208434
• p-INVERT of (1,1,1,1,1,...), where p(S) = 1 - S - S^2 - S^3 - S^4 - S^5.at n=10A291007
• Number of ways of partitioning the set of the first n positive triangular numbers into two subsets whose sums differ at most by 1.at n=27A308682