|
%I #23 Aug 17 2023 11:06:03
%S 0,0,0,0,0,1,0,1,0,1,0,0,0,0,2,0,1,1,0,2,0,1,0,1,1,1,0,2,0,0,0,0,3,0,
%T 1,2,0,2,1,0,3,0,1,0,2,1,1,1,1,2,0,2,0,1,2,1,0,3,0,0,0,0,4,0,1,3,0,2,
%U 2,0,3,1,0,4,0,1,0,3,1,1,2,1,2,1,1,3,0,2,0,2,2,1,1,2,2,0,3,0,1,3,1,0,4,0,0,0,0,5,0,1,4,0,2,3,0,3,2,0,4,1,0,5,0,1,0,4,1,1,3,1,2,2,1,3,1,1,4,0,2,0,3,2,1,2,2,2,1,2,3,0,3,0,2,3,1,1,3,2,0,4,0,1,4,1,0,5,0,0
%N Lexicographic ordering of M x M x M, where M={0,1,2,...}.
%C See A057557 for N x N x N, where N={1,2,3,...}.
%C The triples are sorted first according to their sum, then lexicographically. - _Pontus von Brömssen_, Aug 16 2023
%H Alois P. Heinz, <a href="/A057556/b057556.txt">Table of n, a(n) for n = 1..10962</a>
%e Flatten the list of ordered lattice points, (0,0,0) < (0,0,1) < (0,1,0) < ... to 0,0,0, 0,0,1, 0,1,0, ...
%e As a three-column array:
%e 0 0 0
%e 0 0 1
%e 0 1 0
%e 1 0 0
%e 0 0 2
%e 0 1 1
%e 0 2 0
%e 1 0 1
%e 1 1 0
%e 2 0 0
%e 0 0 3
%e 0 1 2
%e 0 2 1
%e 0 3 0
%e 1 0 2
%e 1 1 1
%e 1 2 0
%e 2 0 1
%e 2 1 0
%e 3 0 0
%e ...
%t lexicographicLattice[{dim_,maxHeight_}]:= Flatten[Array[Sort@Flatten[(Permutations[#1]&)/@IntegerPartitions[#1+dim-1,{dim}],1]&,maxHeight],1]; Flatten@lexicographicLattice[{3,6}]-1
%t (* _Peter J. C. Moses_, Feb 10 2011 *)
%Y Cf. A057554, A057557.
%Y Cf. A144625 (each triple reversed).
%K nonn,tabf
%O 1,15
%A _Clark Kimberling_, Sep 07 2000
%E Extended by _Clark Kimberling_, Feb 10 2011
|
