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.

A222769 T(n,k)=Number of nXk 0..1 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..1 order.

Original entry on oeis.org

1, 0, 0, 0, 3, 0, 3, 4, 4, 0, 4, 11, 13, 20, 0, 4, 18, 66, 96, 48, 0, 5, 73, 158, 465, 301, 175, 0, 20, 152, 934, 2608, 3431, 2242, 512, 0, 27, 470, 2446, 15077, 19766, 25772, 7575, 1719, 0, 48, 1022, 14567, 89811, 256546, 333978, 196185, 55958, 5400, 0, 63, 3361, 39972
Offset: 1

Views

Author

R. H. Hardin Mar 05 2013

Keywords

Comments

Table starts
.1......0........0..........3............4...............4.................5
.0......3........4.........11...........18..............73...............152
.0......4.......13.........66..........158.............934..............2446
.0.....20.......96........465.........2608...........15077.............89811
.0.....48......301.......3431........19766..........256546...........1570588
.0....175.....2242......25772.......333978.........4479721..........62017670
.0....512.....7575.....196185......2645385........79612578........1139211468
.0...1719....55958....1508369.....45830457......1432512703.......46316300783
.0...5400...196442...11685222....370518626.....26011740182......872037778022
.0..17776..1448568...91068653...6504289924....475591230143....36016907441620
.0..57420..5188656..713197411..53224723750...8742929996332...687733392122744
.0.188656.38338122.5607868082.942396671062.161434491485598.28680675666813436

Examples

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

Crossrefs

Row 1 is A222283