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.

A222953 T(n,k)=Number of nXk 0..3 arrays with no adjacent rows or columns having the same least squares slope fit to a straight line, with a single point array taken as having zero slope.

Original entry on oeis.org

4, 0, 0, 0, 212, 0, 0, 2256, 2256, 0, 0, 36302, 125664, 36302, 0, 0, 455904, 8579208, 8579208, 455904, 0, 0, 6471572, 436075392, 3084748094, 436075392, 6471572, 0, 0, 84040156, 25670781880, 690124074740, 690124074740, 25670781880, 84040156, 0, 0
Offset: 1

Views

Author

R. H. Hardin Mar 10 2013

Keywords

Comments

Table starts
.4..........0.............0...............0...............0...............0
.0........212..........2256...........36302..........455904.........6471572
.0.......2256........125664.........8579208.......436075392.....25670781880
.0......36302.......8579208......3084748094....690124074740.194406198823968
.0.....455904.....436075392....690124074740.593420786763904
.0....6471572...25670781880.194406198823968
.0...84040156.1318401732192
.0.1156716696

Examples

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