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.
%I A250692 #7 Feb 21 2018 09:46:11 %S A250692 104,543,2541,11150,47002,193117,780551,3122604,12415380,49197371, %T A250692 194657281,769963978,3046948238,12068103705,47849956731,189941232872, %U A250692 754813261576,3002665654519,11955693334901,47642223194886 %N A250692 Number of (1+1) X (n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. %C A250692 Row 1 of A250691. %H A250692 R. H. Hardin, <a href="/A250692/b250692.txt">Table of n, a(n) for n = 1..210</a> %F A250692 Empirical: a(n) = 16*a(n-1) - 106*a(n-2) + 376*a(n-3) - 769*a(n-4) + 904*a(n-5) - 564*a(n-6) + 144*a(n-7). %F A250692 Empirical g.f.: x*(104 - 1121*x + 4877*x^2 - 11052*x^3 + 13756*x^4 - 8880*x^5 + 2304*x^6) / ((1 - x)^2*(1 - 2*x)^2*(1 - 3*x)^2*(1 - 4*x)). - _Colin Barker_, Feb 21 2018 %e A250692 Some solutions for n=4: %e A250692 ..2..1..1..0..3....2..0..0..0..0....2..3..3..3..2....1..1..2..0..1 %e A250692 ..2..1..1..0..3....2..1..1..1..1....1..2..2..2..1....1..1..2..0..3 %Y A250692 Cf. A250691. %K A250692 nonn %O A250692 1,1 %A A250692 _R. H. Hardin_, Nov 26 2014