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.

A265458 T(n,k)=Number of nXk 0..n+k-2 arrays with each element differing from its horizontal and vertical neighbors by one or two.

Original entry on oeis.org

1, 2, 2, 12, 18, 12, 66, 250, 250, 66, 360, 3358, 7422, 3358, 360, 1864, 42282, 216466, 216466, 42282, 1864, 9358, 502154, 6056182, 13943772, 6056182, 502154, 9358, 45642, 5710302, 161435322, 871209026, 871209026, 161435322, 5710302, 45642
Offset: 1

Views

Author

R. H. Hardin, Dec 09 2015

Keywords

Comments

Table starts
....1.......2.........12............66..............360................1864
....2......18........250..........3358............42282..............502154
...12.....250.......7422........216466..........6056182...........161435322
...66....3358.....216466......13943772........871209026.........52509347006
..360...42282....6056182.....871209026.....122895678174......16879041018070
.1864..502154..161435322...52509347006...16879041018070....5327856426356284
.9358.5710302.4148236142.3073046007824.2268041942592142.1653688201339124766

Examples

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