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.

Showing 1-1 of 1 results.

A203491 T(n,k)=Number of nXk 0..2 arrays with row sums equal and column sums unequal to adjacent columns.

Original entry on oeis.org

3, 6, 3, 12, 10, 3, 24, 80, 36, 3, 48, 556, 624, 82, 3, 96, 3348, 9540, 3760, 256, 3, 192, 20596, 170868, 173860, 25002, 676, 3, 384, 134412, 3171708, 8518564, 3065704, 171068, 2050, 3, 768, 888232, 59683122, 442135180, 421158558, 56438584, 1107888
Offset: 1

Views

Author

R. H. Hardin Jan 02 2012

Keywords

Comments

Table starts
.3.....6......12.........24..........48..........96.........192........384
.3....10......80........556........3348.......20596......134412.....888232
.3....36.....624.......9540......170868.....3171708....59683122.1152091884
.3....82....3760.....173860.....8518564...442135180.24148894412
.3...256...25002....3065704...421158558.61706303456
.3...676..171068...56438584.20726134056
.3..2050.1107888.1004305424
.3..5826.7411872
.3.17568
.3

Examples

			Some solutions for n=5 k=3
..0..0..1....0..0..2....1..2..1....0..1..2....0..2..0....2..2..1....1..1..0
..0..0..1....2..0..0....2..1..1....0..1..2....0..0..2....2..1..2....1..1..0
..0..1..0....0..1..1....1..2..1....2..1..0....2..0..0....2..1..2....1..1..0
..0..0..1....2..0..0....2..1..1....1..1..1....2..0..0....1..2..2....0..0..2
..0..0..1....0..0..2....1..2..1....2..0..1....1..1..0....2..1..2....2..0..0

Links

Crossrefs

Diagonal is A202712
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.