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.

A250696 Number of (5+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.

This page as a plain text file.
%I A250696 #6 Jul 23 2025 12:42:31
%S A250696 53032,362241,1848953,8038566,31728758,117793753,420283865,1461625340,
%T A250696 5002774320,16967929009,57302621481,193328559946,653111062242,
%U A250696 2212763076073,7527314240137,25733887423136,88490379721660
%N A250696 Number of (5+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 A250696 Row 5 of A250691
%H A250696 R. H. Hardin, <a href="/A250696/b250696.txt">Table of n, a(n) for n = 1..188</a>
%F A250696 Empirical: a(n) = 30*a(n-1) -415*a(n-2) +3514*a(n-3) -20386*a(n-4) +85924*a(n-5) -272198*a(n-6) +661180*a(n-7) -1244717*a(n-8) +1822478*a(n-9) -2068955*a(n-10) +1802474*a(n-11) -1181760*a(n-12) +563888*a(n-13) -184752*a(n-14) +37152*a(n-15) -3456*a(n-16)
%e A250696 Some solutions for n=1
%e A250696 ..3..0....2..0....1..1....1..0....3..1....3..0....2..0....0..0....3..3....3..0
%e A250696 ..3..3....2..0....3..3....2..2....3..1....3..0....1..1....2..3....1..1....3..0
%e A250696 ..1..1....1..1....0..0....2..2....2..0....2..1....2..2....1..2....0..0....3..0
%e A250696 ..2..3....0..0....3..3....1..1....2..0....1..0....3..3....0..1....1..2....3..2
%e A250696 ..1..2....2..2....1..1....2..3....1..1....0..1....1..1....2..3....0..1....1..0
%e A250696 ..0..3....0..0....2..3....2..3....1..2....0..3....1..3....0..1....1..2....1..2
%K A250696 nonn
%O A250696 1,1
%A A250696 _R. H. Hardin_, Nov 26 2014