cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A192698 Number of 2X3 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 2 zero-sum 3-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).

This page as a plain text file.
%I A192698 #7 Jun 02 2025 04:12:38
%S A192698 2,8,20,54,104,190,323,529,795,1181,1653,2297,3088,4119,5307,6804,
%T A192698 8518,10618,13029,15955,19160,22996,27203,32102,37584,43811,50621,
%U A192698 58445,66858,76327,86710,98294,110610,124474,139222,155502,173011,192273,212726
%N A192698 Number of 2X3 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 2 zero-sum 3-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).
%C A192698 Column (2,3,n) of A192710
%H A192698 R. H. Hardin, <a href="/A192698/b192698.txt">Table of n, a(n) for n = 1..200</a>
%e A192698 Some solutions for 2X3 <= 2*4^2
%e A192698 .-3..0..3...-1..0..1...-2.-1..3...-2.-1..3...-2.-2..4...-1.-1..2...-1.-1..2
%e A192698 .-3..1..2....0..0..0...-2..1..1...-2.-1..3...-1.-1..2....0..0..0...-1.-1..2
%K A192698 nonn
%O A192698 1,1
%A A192698 _R. H. Hardin_ Jul 07 2011