login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A250851
Number of (n+1) X (6+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.
1
14400, 103293, 614965, 3204951, 15344785, 69543783, 303858745, 1294875471, 5422612945, 22429374423, 91953454825, 374560079391, 1518555885505, 6135323831463, 24724903375705, 99451052025711, 399459752428465
OFFSET
1,1
LINKS
FORMULA
Empirical: a(n) = 10*a(n-1) - 35*a(n-2) + 50*a(n-3) - 24*a(n-4); a(n) = (282492*4^n - 462196*3^n + 224994*2^n - 20568)/12.
Empirical g.f.: x*(14400 - 40707*x + 86035*x^2 - 49444*x^3) / ((1 - x)*(1 - 2*x)*(1 - 3*x)*(1 - 4*x)). - Colin Barker, Nov 21 2018
EXAMPLE
Some solutions for n=2:
..1..1..0..1..1..1..1....3..3..2..3..3..3..3....3..3..2..2..1..1..1
..0..0..0..1..2..3..3....0..0..1..2..2..2..2....0..0..0..0..0..0..0
..0..0..0..1..2..3..3....0..0..1..2..2..3..3....1..1..1..1..3..3..3
CROSSREFS
Column 6 of A250853.
Sequence in context: A253266 A190469 A237372 * A226286 A203729 A144649
KEYWORD
nonn
AUTHOR
R. H. Hardin, Nov 28 2014
STATUS
approved