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.

A208872 T(n,k)=Number of nXk 0..3 arrays with new values 0..3 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.

Original entry on oeis.org

1, 2, 2, 5, 12, 5, 15, 136, 143, 15, 51, 1798, 6520, 1979, 51, 187, 24472, 307165, 324682, 28246, 187, 715, 334618, 14493405, 52947540, 16205218, 405481, 715, 2795, 4578580, 683903931, 8624977114, 9130195864, 808928836, 5826959, 2795, 11051, 62655190
Offset: 1

Views

Author

R. H. Hardin Mar 02 2012

Keywords

Comments

Table starts
....1........2.............5................15.....................51
....2.......12...........136..............1798..................24472
....5......143..........6520............307165...............14493405
...15.....1979........324682..........52947540.............8624977114
...51....28246......16205218........9130195864..........5134914951163
..187...405481.....808928836.....1574432811027.......3057224057476808
..715..5826959...40380275500...271499374919883....1820216057105650386
.2795.83752328.2015711853262.46818078167209471.1083724145919960847502

Examples

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

Crossrefs

Column 1 and row 1 are A007581(n-1)