The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 Apr 20 2021 12:34:19
%S 1,98,5897,312604,14027391,539625139,18131486831,541077286873,
%T 14533375222752,355152145922937,7965464463977638,165169207300414826,
%U 3186082489177522116,57478616703131109039,974288796548462899774
%N Number of n X 4 0..3 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other.
%C Column 4 of A201393.
%H R. H. Hardin, <a href="/A201389/b201389.txt">Table of n, a(n) for n = 1..16</a>
%e Some solutions for n=3
%e ..0..0..1..3....0..1..2..3....0..1..1..3....0..1..1..2....0..0..1..2
%e ..1..2..2..3....1..2..3..0....3..1..2..2....1..3..3..0....0..3..2..3
%e ..2..3..1..0....3..2..0..1....3..2..0..0....3..0..2..2....1..3..1..2
%Y Cf. A201393.
%K nonn
%O 1,2
%A _R. H. Hardin_ Nov 30 2011