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.

A284113 T(n,k) = Number of n X k 0..1 arrays with the number of 1's king-move adjacent to some 0 equal to the number of 0's adjacent to some 1, with top left element zero.

Original entry on oeis.org

1, 2, 2, 3, 4, 3, 6, 13, 13, 6, 10, 46, 25, 46, 10, 19, 160, 435, 435, 160, 19, 33, 571, 1230, 5896, 1230, 571, 33, 62, 2095, 20275, 80200, 80200, 20275, 2095, 62, 112, 7802, 67957, 1143533, 905327, 1143533, 67957, 7802, 112, 212, 29326, 1057769, 16442183
Offset: 1

Views

Author

R. H. Hardin, Mar 20 2017

Keywords

Comments

Table starts
...1......2........3...........6.............10................19
...2......4.......13..........46............160...............571
...3.....13.......25.........435...........1230.............20275
...6.....46......435........5896..........80200...........1143533
..10....160.....1230.......80200.........905327..........61595318
..19....571....20275.....1143533.......61595318........3514396333
..33...2095....67957....16442183......835390074......202053817163
..62...7802..1057769...240146980....51786529350....11804599876991
.112..29326..4091201..3538905880...809052347723...696189477669561
.212.111040.57977326.52568393480.45439256969227.41397421665690592

Examples

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

Crossrefs

Column 1 is A274160(n+1).