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.

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

Original entry on oeis.org

2, 4, 4, 6, 16, 6, 9, 36, 36, 10, 13, 81, 84, 100, 16, 19, 169, 198, 292, 256, 26, 28, 361, 462, 870, 912, 676, 42, 41, 784, 1080, 2446, 3358, 2812, 1764, 68, 60, 1681, 2520, 6952, 11196, 12040, 8928, 4624, 110, 88, 3600, 5886, 20168, 38160, 49442, 47320, 28152
Offset: 1

Views

Author

R. H. Hardin Feb 21 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....84....198.....462....1080.....2520......5886......13746......32100
.10..100...292....870....2446....6952....20168.....57838.....164914.....473632
.16..256...912...3358...11196...38160...135714....471374....1605156....5575548
.26..676..2812..12040...49442..205258...856480...3559040...14795830...61589756
.42.1764..8928..47320..231900.1153532..5888458..29719004..148308700..747498440
.68.4624.28152.182192.1070030.6420722.39828558.243318702.1460399404.8907998820

Examples

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

Crossrefs

Column 1 is A006355(n+2)
Column 2 is A206981
Column 3 is A207341
Column 4 is A207662
Row 1 is A000930(n+3)
Row 2 is A207170