234793

Appears in sequences

• Fifth binomial transform of Fibonacci numbers F(n).at n=7A081575
• Number of 1X10 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 1 zero-sum 10-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=11A192697