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.

A204705 T(n,k) = Number of n X k 0..2 arrays with no occurrence of three equal elements in a row horizontally, vertically or nw-to-se diagonally, and new values 0..2 introduced in row major order.

Original entry on oeis.org

1, 2, 2, 4, 14, 4, 11, 96, 96, 11, 30, 726, 1417, 726, 30, 82, 5400, 22869, 22869, 5400, 82, 224, 40344, 362020, 835135, 362020, 40344, 224, 612, 301056, 5767683, 29846373, 29846373, 5767683, 301056, 612, 1672, 2247264, 91733605, 1074195735, 2389914827
Offset: 1

Views

Author

R. H. Hardin, Jan 18 2012

Keywords

Comments

Table starts
...1.......2..........4............11...............30..................82
...2......14.........96...........726.............5400...............40344
...4......96.......1417.........22869...........362020.............5767683
..11.....726......22869........835135.........29846373..........1074195735
..30....5400.....362020......29846373.......2389914827........192759130113
..82...40344....5767683....1074195735.....192759130113......34925753412578
.224..301056...91733605...38585324821...15521787839696....6319625580942184
.612.2247264.1459710274.1386815731346.1250634888842984.1144097011453760287

Examples

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

Crossrefs

Column 1 is A021006(n-3).