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.

A205255 T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the number of clockwise edge increases in every 2X2 subblock the same.

Original entry on oeis.org

16, 40, 40, 112, 168, 112, 328, 752, 752, 328, 976, 3416, 5212, 3416, 976, 2920, 15568, 36304, 36304, 15568, 2920, 8752, 71000, 253072, 387328, 253072, 71000, 8752, 26248, 323856, 1764364, 4136296, 4136296, 1764364, 323856, 26248, 78736, 1477272
Offset: 1

Views

Author

R. H. Hardin Jan 24 2012

Keywords

Comments

Table starts
....16......40......112........328..........976...........2920.............8752
....40.....168......752.......3416........15568..........71000...........323856
...112.....752.....5212......36304.......253072........1764364.........12301024
...328....3416....36304.....387328......4136296.......44183032........471988176
...976...15568...253072....4136296.....67731268.....1109832184......18189909484
..2920...71000..1764364...44183032...1109832184....27913330476.....702420750928
..8752..323856.12301024..471988176..18189909484...702420750928...27149753088796
.26248.1477272.85762192.5042151648.298154846440.17679917387408.1049837466171440

Examples

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