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.

A186558 T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock commuting with any of its horizontal and vertical 2X2 subblock neighbors.

Original entry on oeis.org

256, 3891, 3891, 60074, 227890, 60074, 927477, 13360840, 13360840, 927477, 14319230, 783375343, 2976803436, 783375343, 14319230, 221073168, 45931015744, 663296784123, 663296784123, 45931015744, 221073168, 3413126694
Offset: 1

Views

Author

R. H. Hardin Feb 23 2011

Keywords

Comments

Table starts
.........256............3891.............60074.............927477
........3891..........227890..........13360840..........783375343
.......60074........13360840........2976803436.......663296784123
......927477.......783375343......663296784123....561714653720250
....14319230.....45931015744...147795682647630.475681559860717916
...221073168...2693039069563.32931888185295104
..3413126694.157898954845170
.52694924343

Examples

			Some solutions for 4X3
..0..0..0....3..0..0....2..0..0....0..0..0....0..0..0....1..0..0....1..0..0
..3..1..0....3..2..0....1..1..0....1..1..0....3..2..0....0..3..0....1..2..0
..3..0..3....1..3..3....3..2..3....3..1..0....0..2..0....2..1..2....0..0..0
..2..1..3....0..1..2....0..0..0....1..3..0....0..3..1....2..3..2....3..1..2