cp's OEIS Frontend

A192696 Number of 1X9 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 9-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).

%I A192696 #7 Jun 02 2025 04:12:28
%S A192696 2,10,48,185,577,1570,3840,8577,17690,34551,63830,112942,192361,
%T A192696 317003,506670,789958,1201985,1791493,2619745,3765999,5326330,7428899,
%U A192696 10220081,13894828,18669185,24830564,32689442,42659878,55175883,70815315,90176720
%N A192696 Number of 1X9 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 9-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).
%C A192696 Column (1,9,n) of A192710
%H A192696 R. H. Hardin, <a href="/A192696/b192696.txt">Table of n, a(n) for n = 1..68</a>
%e A192696 Some solutions for 1X9 <= 2*4^2
%e A192696 .-3.-2..0..0..1..1..1..1..1...-2.-2.-1.-1.-1..0..1..3..3
%K A192696 nonn
%O A192696 1,1
%A A192696 _R. H. Hardin_ Jul 07 2011