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.

A185903 T(n,k)=1/8 the number of nXk 0..7 arrays with every element equal to exactly one or two of its horizontal and vertical neighbors.

Original entry on oeis.org

0, 1, 1, 1, 15, 1, 8, 196, 196, 8, 15, 2765, 7854, 2765, 15, 71, 38731, 546280, 546280, 38731, 71, 176, 545328, 28967421, 139230658, 28967421, 545328, 176, 673, 7675381, 1748982326, 32611077940, 32611077940, 1748982326, 7675381, 673, 1905
Offset: 1

Views

Author

R. H. Hardin Feb 06 2011

Keywords

Comments

Table starts
....0.........1...........1.............8.............15............71
....1........15.........196..........2765..........38731........545328
....1.......196........7854........546280.......28967421....1748982326
....8......2765......546280.....139230658....32611077940.7921723799549
...15.....38731....28967421...32611077940.30884279980274
...71....545328..1748982326.7921723799549
..176...7675381.98953708266
..673.108065699
.1905

Examples

			Some solutions for 4X3 with a(1,1)=0
..0..4..5....0..0..4....0..4..0....0..0..6....0..4..2....0..4..6....0..0..3
..0..4..5....4..4..4....0..4..0....4..4..6....0..4..2....0..4..6....4..0..3
..1..1..4....6..7..3....6..6..0....4..4..5....5..3..3....2..0..0....4..0..0
..1..1..4....6..7..3....5..5..0....3..3..5....5..5..5....2..5..5....4..4..4
		

Crossrefs

Column 1 is A015442(n-1)