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.

A203975 T(n,k)=Number of nXk 0..2 arrays with every 1 immediately preceded by 0 to the left or above, and every 2 immediately preceded by 0 1 to the left or above.

Original entry on oeis.org

1, 2, 2, 4, 7, 4, 7, 29, 29, 7, 13, 106, 258, 106, 13, 24, 396, 2061, 2061, 396, 24, 44, 1488, 16723, 34799, 16723, 1488, 44, 81, 5569, 136243, 601521, 601521, 136243, 5569, 81, 149, 20859, 1107082, 10443081, 22100882, 10443081, 1107082, 20859, 149, 274
Offset: 1

Views

Author

R. H. Hardin Jan 08 2012

Keywords

Comments

Table starts
..1.....2.......4..........7............13..............24.................44
..2.....7......29........106...........396............1488...............5569
..4....29.....258.......2061.........16723..........136243............1107082
..7...106....2061......34799........601521........10443081..........180623180
.13...396...16723.....601521......22100882.......817293052........30104480870
.24..1488..136243...10443081.....817293052.....64449537503......5061444598545
.44..5569.1107082..180623180...30104480870...5061444598545....847220834970347
.81.20859.9001543.3127443494.1109867821460.397834775050740.141937054743243405

Examples

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

Crossrefs

Column 1 is A000073(n+2)