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.

A202742 T(n,k)=Number of nXk 0..1 arrays with row sums equal and column sums unequal to adjacent columns.

Original entry on oeis.org

2, 2, 2, 2, 2, 2, 2, 6, 8, 2, 2, 22, 38, 10, 2, 2, 54, 140, 86, 32, 2, 2, 102, 638, 838, 282, 44, 2, 2, 214, 3032, 6870, 5092, 1074, 128, 2, 2, 582, 14258, 62398, 75302, 29680, 2802, 186, 2, 2, 1590, 70136, 613950, 1375912, 827502, 183220, 8694, 512, 2, 2, 3814
Offset: 1

Views

Author

R. H. Hardin Dec 23 2011

Keywords

Comments

Table starts
.2...2.....2........2...........2............2.............2.............2
.2...2.....6.......22..........54..........102...........214...........582
.2...8....38......140.........638.........3032.........14258.........70136
.2..10....86......838........6870........62398........613950.......6018166
.2..32...282.....5092.......75302......1375912......24620522.....472929952
.2..44..1074....29680......827502.....27842760.....967878370...35772388788
.2.128..2802...183220.....8870150....578826040...37121438930.2639009446600
.2.186..8694..1061814....93402390..11600238174.1401569558590
.2.512.30170..6630116...969837470.239443637912
.2.772.82286.39048472.10133577294

Examples

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