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.

A184673 T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock summing to less than 6.

Original entry on oeis.org

150, 1740, 1740, 19269, 67330, 19269, 216912, 2405797, 2405797, 216912, 2430631, 88458672, 266060160, 88458672, 2430631, 27278035, 3225439429, 30765364899, 30765364899, 3225439429, 27278035, 305991368, 117938741095, 3509487618613
Offset: 1

Views

Author

R. H. Hardin Jan 19 2011

Keywords

Comments

Table starts
.......150..........1740.............19269................216912
......1740.........67330...........2405797..............88458672
.....19269.......2405797.........266060160...........30765364899
....216912......88458672.......30765364899........11348244616180
...2430631....3225439429.....3509487618613......4110692224930359
..27278035..117938741095...402221585928132...1498459859767029015
.305991368.4308670152724.46028365937520330.545098899148923125052

Examples

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