352467

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=29A058498
• Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 2 X n array.at n=29A220205
• 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=30A308682