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.

A206889 T(n,k)=Number of nXk 0..1 arrays avoiding 0 1 0 horizontally and 1 0 0 vertically.

Original entry on oeis.org

2, 4, 4, 7, 16, 7, 12, 49, 49, 12, 21, 144, 240, 144, 20, 37, 441, 1103, 1112, 400, 33, 65, 1369, 5357, 7878, 4792, 1089, 54, 114, 4225, 26564, 59812, 51800, 20129, 2916, 88, 200, 12996, 130828, 467146, 607043, 330951, 82807, 7744, 143, 351, 40000, 641137
Offset: 1

Views

Author

R. H. Hardin Feb 13 2012

Keywords

Comments

Table starts
..2....4......7.......12........21..........37............65............114
..4...16.....49......144.......441........1369..........4225..........12996
..7...49....240.....1103......5357.......26564........130828.........641137
.12..144...1112.....7878.....59812......467146.......3619683.......27856426
.20..400...4792....51800....607043.....7354488......88342972.....1052865902
.33.1089..20129...330951...5963040...111550389....2067672443....37988878275
.54.2916..82807..2070564..57268342..1648854501...47015346159..1328156697136
.88.7744.337209.12830802.544455870.24096775331.1055711535814.45805591252624

Examples

			Some solutions for n=4 k=3
..1..1..0....0..1..1....1..1..0....0..0..1....0..0..0....0..0..1....1..0..0
..0..0..0....0..1..1....0..0..0....0..0..0....1..0..0....0..1..1....1..0..1
..1..1..1....0..1..1....1..1..1....1..1..1....0..1..1....1..0..0....1..0..1
..1..0..0....0..1..1....0..1..1....0..0..0....1..0..1....1..1..1....1..0..1
		

Crossrefs

Column 1 is A000071(n+3)
Column 2 is A188516
Column 3 is A188757
Row 1 is A005251(n+3)
Row 2 is A188501
Row 3 is A188768