cp's OEIS Frontend

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

%I A192692 #7 Jun 02 2025 04:12:07
%S A192692 2,8,21,48,93,170,285,452,674,985,1379,1894,2524,3307,4272,5414,6790,
%T A192692 8406,10290,12475,14998,17857,21159,24847,29047,33708,38944,44737,
%U A192692 51180,58301,66094,74687,84097,94333,105510,117600,130807,144983,160325,176837
%N A192692 Number of 1X5 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 5-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).
%C A192692 Column (1,5,n) of A192710
%H A192692 R. H. Hardin, <a href="/A192692/b192692.txt">Table of n, a(n) for n = 1..200</a>
%e A192692 Some solutions for 1X5 <= 2*4^2
%e A192692 .-2.-1..1..1..1...-2.-1..0..1..2...-1.-1..0..1..1...-2..0..0..1..1
%K A192692 nonn
%O A192692 1,1
%A A192692 _R. H. Hardin_ Jul 07 2011