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.

A199647 T(n,k)=Number of nXk 0..2 arrays with values 0..2 introduced in row major order and each element equal to one or two horizontal and vertical neighbors.

Original entry on oeis.org

0, 1, 1, 1, 3, 1, 2, 13, 13, 2, 3, 60, 112, 60, 3, 6, 288, 1265, 1265, 288, 6, 11, 1384, 12748, 29229, 12748, 1384, 11, 22, 6628, 134748, 658770, 658770, 134748, 6628, 22, 43, 31772, 1396083, 15066222, 32177372, 15066222, 1396083, 31772, 43, 86, 152304
Offset: 1

Views

Author

R. H. Hardin Nov 08 2011

Keywords

Comments

Table starts
..0......1..........1.............2................3..................6
..1......3.........13............60..............288...............1384
..1.....13........112..........1265............12748.............134748
..2.....60.......1265.........29229...........658770...........15066222
..3....288......12748........658770.........32177372.........1614250077
..6...1384.....134748......15066222.......1614250077.......176701683386
.11...6628....1396083.....342328663......80053957248.....19161971644783
.22..31772...14584050....7797114144....3988024796446...2085499380111100
.43.152304..151837464..177447181083..198328767139736.226676302441401393
.86.730036.1582988477.4039488090307.9869645990489747

Examples

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

Crossrefs

Column 1 is A005578(n-2)