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.

A233298 Number of (n+1) X (2+1) 0..1 arrays x(i,j) with row sums Sum_{j=1..2+1} x(i,j) nondecreasing, and column sums Sum_{i=1..n+1} i^2*x(i,j) nondecreasing.

Original entry on oeis.org

13, 42, 141, 502, 1739, 5964, 20185, 67609, 224165, 737347, 2407911, 7814616, 25223004, 81015137, 259099567, 825507109, 2621224089, 8298060296, 26197890927, 82506334112, 259260476024
Offset: 1

Views

Author

R. H. Hardin, Dec 07 2013

Keywords

Comments

Column 2 of A233301.

Examples

			Some solutions for n=5
..0..1..0....1..1..0....0..0..0....0..0..0....0..0..1....0..0..0....1..0..0
..1..1..0....1..1..0....0..0..0....0..1..0....0..1..0....0..0..0....0..0..1
..0..1..1....1..0..1....1..0..0....0..0..1....0..1..0....0..0..0....1..1..0
..0..1..1....0..1..1....0..1..0....0..0..1....0..0..1....0..0..0....1..1..0
..1..0..1....0..1..1....0..0..1....0..0..1....1..0..0....0..0..1....1..0..1
..0..1..1....1..1..1....1..1..1....1..1..1....0..1..1....0..1..1....0..1..1
		

Crossrefs

Cf. A233301.