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.

A284455 T(n,k) = Number of n X k 0..1 arrays with the number of 1's king-move adjacent to some 0 one less than the number of 0's adjacent to some 1.

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 2, 0, 0, 2, 6, 0, 102, 0, 6, 12, 0, 250, 250, 0, 12, 28, 0, 5253, 3384, 5253, 0, 28, 56, 0, 16478, 54248, 54248, 16478, 0, 56, 119, 0, 278315, 824052, 4190874, 824052, 278315, 0, 119, 236, 0, 1019120, 12957944, 52793160, 52793160, 12957944, 1019120
Offset: 1

Views

Author

R. H. Hardin, Mar 27 2017

Keywords

Comments

Table starts
...0.0........1..........2.............6..............12.................28
...0.0........0..........0.............0...............0..................0
...1.0......102........250..........5253...........16478.............278315
...2.0......250.......3384.........54248..........824052...........12957944
...6.0.....5253......54248.......4190874........52793160.........3478866516
..12.0....16478.....824052......52793160......3177012844.......197373621124
..28.0...278315...12957944....3478866516....197373621124.....45913351929099
..56.0..1019120..203401448...51105257464..12262301470824...3020610942888634
.119.0.15188955.3209101642.3013637890236.765844185617960.635171432700031740

Examples

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