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.

Showing 1-1 of 1 results.

A207762 T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically.

Original entry on oeis.org

2, 4, 4, 6, 16, 6, 9, 36, 36, 9, 13, 81, 82, 81, 14, 19, 169, 221, 193, 196, 21, 28, 361, 493, 663, 488, 441, 31, 41, 784, 1095, 1664, 2245, 1087, 961, 46, 60, 1681, 2654, 4018, 6552, 6459, 2305, 2116, 68, 88, 3600, 6203, 11509, 16920, 21547, 17563, 4932, 4624, 100
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Table starts
..2....4....6.....9.....13.....19......28.......41.......60........88
..4...16...36....81....169....361.....784.....1681.....3600......7744
..6...36...82...221....493...1095....2654.....6203....14182.....33242
..9...81..193...663...1664...4018...11509....30943....79178....213444
.14..196..488..2245...6552..16920...59252...188350...538950...1709438
.21..441.1087..6459..21547..56651..235872...862146..2629798...9529570
.31..961.2305.17563..67330.178627..887114..3733566.11979209..49800326
.46.2116.4932.48649.217902.581166.3488718.17141340.57575203.278302021

Examples

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

Crossrefs

Column 1 is A038718(n+2)
Column 2 is A207069
Column 3 is A207264
Row 1 is A000930(n+3)
Row 2 is A207170
Showing 1-1 of 1 results.