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.

A207550 T(n,k) = Number of n X k 0..2 arrays avoiding the pattern z-2 z-1 z in any row, column, nw-to-se diagonal or ne-to-sw antidiagonal.

Original entry on oeis.org

3, 9, 9, 26, 81, 26, 75, 676, 676, 75, 216, 5625, 14974, 5625, 216, 622, 46656, 327518, 327899, 46656, 622, 1791, 386884, 7169168, 18584111, 7104784, 386884, 1791, 5157, 3207681, 156957792, 1058580304, 1033847229, 153718531, 3207681, 5157, 14849
Offset: 1

Views

Author

R. H. Hardin, Feb 18 2012

Keywords

Comments

Table starts
....3........9..........26..............75................216
....9.......81.........676............5625..............46656
...26......676.......14974..........327518............7169168
...75.....5625......327899........18584111.........1058580304
..216....46656.....7104784......1033847229.......151596413811
..622...386884...153718531.....57282563287.....21553876840265
.1791..3207681..3323115736...3168082336959...3054158366460488
.5157.26594649.71828785449.175129179194410.432330439527473859

Examples

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

Crossrefs

Column 1 is A076264.
Column 2 is A206694.
Row 1 is A076264.
Row 2 is A206694.