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.

A250681 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 A250681 #6 Jul 23 2025 12:41:03
%S A250681 53032,1185860,22408818,379890972,5803025694,81461365899,
%T A250681 1070591197687,13342424067588,159420803863398,1840705572880672,
%U A250681 20670321639041067,226864703962443259,2443264607642994051,25901583586093676145
%N A250681 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 A250681 Row 5 of A250676
%H A250681 R. H. Hardin, <a href="/A250681/b250681.txt">Table of n, a(n) for n = 1..210</a>
%e A250681 Some solutions for n=1
%e A250681 ..1..0....0..3....2..0....0..2....0..3....1..0....3..0....0..2....0..3....0..1
%e A250681 ..1..1....3..0....1..1....2..0....1..2....1..2....3..2....0..2....3..0....1..3
%e A250681 ..0..2....3..0....2..0....1..1....2..1....2..1....3..2....1..1....2..2....2..2
%e A250681 ..2..0....1..2....3..3....1..2....1..3....3..0....2..3....0..2....2..2....1..3
%e A250681 ..2..1....3..0....3..3....1..3....3..1....3..1....3..2....2..0....3..1....3..1
%e A250681 ..2..2....2..2....3..3....2..2....2..2....3..2....3..2....1..2....3..3....3..1
%K A250681 nonn
%O A250681 1,1
%A A250681 _R. H. Hardin_, Nov 26 2014