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.

A206255 T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having zero permanent.

Original entry on oeis.org

49, 361, 361, 1600, 8029, 1600, 9409, 99856, 99856, 9409, 47089, 1718209, 1364224, 1718209, 47089, 258064, 26512201, 49336576, 49336576, 26512201, 258064, 1343281, 434613664, 944701696, 4556324929, 944701696, 434613664, 1343281, 7198489
Offset: 1

Views

Author

R. H. Hardin, Feb 05 2012

Keywords

Comments

Table starts
......49..........361...........1600..............9409................47089
.....361.........8029..........99856...........1718209.............26512201
....1600........99856........1364224..........49336576............944701696
....9409......1718209.......49336576........4556324929.........226637884225
...47089.....26512201......944701696......226637884225.......14139111560401
..258064....434613664....27285753856....16533087493120.....2261195747329024
.1343281...6990799321...603269103616..1006239668280961...186370092021300625
.7198489.113636628469.15860529270784.68438717405988481.24455901146017548025

Examples

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

Crossrefs

Cf. A006130.

Formula

Column 1 is A006130(n+2)^2.