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.

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

This page as a plain text file.
%I A233059 #6 Jul 23 2025 07:49:58
%S A233059 13,47,161,564,1933,6529,21904,72710,238992,781279,2537019,8187471,
%T A233059 26318697,84221878,268396362,852861982,2701532776,8532060967,
%U A233059 26887756403,84535960052,265197189246,830543999898,2596441897488,8103132791812
%N A233059 Number of (n+1)X(2+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..2+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing.
%C A233059 Column 2 of A233062
%H A233059 R. H. Hardin, <a href="/A233059/b233059.txt">Table of n, a(n) for n = 1..35</a>
%e A233059 Some solutions for n=5
%e A233059 ..0..0..1....0..0..1....0..0..0....0..1..0....0..0..0....0..0..1....0..1..0
%e A233059 ..0..0..1....1..0..1....0..0..0....1..0..0....1..1..0....0..0..1....1..0..0
%e A233059 ..1..1..0....1..0..1....1..0..0....0..1..1....0..1..1....0..1..0....0..1..1
%e A233059 ..1..1..0....1..1..0....0..0..1....0..1..1....1..0..1....1..0..1....1..0..1
%e A233059 ..1..0..1....0..1..1....0..1..1....1..1..0....1..0..1....0..1..1....0..1..1
%e A233059 ..0..1..1....1..1..1....1..1..1....1..0..1....0..1..1....0..1..1....1..1..1
%K A233059 nonn
%O A233059 1,1
%A A233059 _R. H. Hardin_, Dec 03 2013