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.

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

Original entry on oeis.org

2, 4, 4, 6, 16, 6, 9, 36, 36, 9, 15, 81, 114, 81, 14, 25, 225, 361, 387, 196, 22, 40, 625, 1425, 1849, 1414, 484, 35, 64, 1600, 5625, 10535, 10201, 5302, 1225, 56, 104, 4096, 20550, 60025, 86355, 58081, 20265, 3136, 90, 169, 10816, 75076, 327075, 731025
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Table starts
..2....4.....6.......9.......15.........25..........40............64
..4...16....36......81......225........625........1600..........4096
..6...36...114.....361.....1425.......5625.......20550.........75076
..9...81...387....1849....10535......60025......327075.......1782225
.14..196..1414...10201....86355.....731025.....5959350......48580900
.22..484..5302...58081...733363....9259849...113534330....1392036100
.35.1225.20265..335241..6349893..120275089..2215586241...40813292529
.56.3136.78120.1946025.55343835.1573946929.43590708750.1207251562500

Examples

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

Crossrefs

Column 1 is A001611(n+2)
Column 2 is A207436
Column 3 is A207712
Row 1 is A006498(n+2)
Row 2 is A189145(n+2)
Row 3 is A207427
Showing 1-1 of 1 results.