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.

A199655 T(n,k) = Number of n X k 0..2 arrays with values 0..2 introduced in row major order and each element equal to no more than two horizontal and vertical neighbors.

Original entry on oeis.org

1, 2, 2, 5, 14, 5, 14, 113, 113, 14, 41, 953, 2584, 953, 41, 122, 8037, 59212, 59212, 8037, 122, 365, 67774, 1357484, 3695683, 1357484, 67774, 365, 1094, 571530, 31120632, 230693158, 230693158, 31120632, 571530, 1094, 3281, 4819638, 713445976
Offset: 1

Views

Author

R. H. Hardin Nov 08 2011

Keywords

Comments

Table starts
....1.........2.............5.................14.....................41
....2........14...........113................953...................8037
....5.......113..........2584..............59212................1357484
...14.......953.........59212............3695683..............230693158
...41......8037.......1357484..........230693158............39209840355
..122.....67774......31120632........14399942873..........6663970316970
..365....571530.....713445976.......898852775335.......1132589231853096
.1094...4819638...16355879648.....56106912155198.....192491652879392515
.3281..40643380..374961537040...3502225890582058...32715334199617664326
.9842.342740340.8596061907680.218610965399514236.5560205218374521415185

Examples

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

Crossrefs

Column 1 is A007051(n-1).