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.

A213697 T(n,k)=Half the number of (n+1)X(n+1) symmetric 0..k arrays with no 2X2 subblock summing to 2k.

Original entry on oeis.org

3, 11, 13, 28, 192, 70, 56, 1320, 7827, 529, 99, 5470, 208072, 750261, 5148, 159, 17499, 2322599, 109820000, 168382284, 68798, 240, 45892, 16537086, 4286833981, 193946752094, 88681187619, 1220409, 344, 105856, 84059234, 83545858925
Offset: 1

Views

Author

R. H. Hardin Jun 18 2012

Keywords

Comments

Table starts
.....3..........11...............28..................56....................99
....13.........192.............1320................5470.................17499
....70........7827...........208072.............2322599..............16537086
...529......750261........109820000..........4286833981...........83545858925
..5148...168382284.....193946752094......34389632236877......2256314178023600
.68798.88681187619.1146407046198040.1199143411128185584.325754552781442854792

Examples

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

Crossrefs

Row 1 is A182260(n+1)