cp's OEIS Frontend

A192697 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).

%I A192697 #7 Jun 02 2025 04:12:33
%S A192697 2,10,54,223,758,2239,5888,14055,30973,64220,125681,234793,421151,
%T A192697 728848,1221122,1990599,3162071,4910443,7471318,11154759,16368766,
%U A192697 23649285,33671936,47306193,65642371,90041983,122175046,164141152,218451247
%N A192697 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).
%C A192697 Column (1,10,n) of A192710
%H A192697 R. H. Hardin, <a href="/A192697/b192697.txt">Table of n, a(n) for n = 1..53</a>
%e A192697 Some solutions for 1X10 <= 2*4^2
%e A192697 .-3.-2.-1.-1.-1..1..1..2..2..2...-3.-2.-2..0..0..1..1..1..1..3
%K A192697 nonn
%O A192697 1,1
%A A192697 _R. H. Hardin_ Jul 07 2011