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.

A212044 T(n,k)=Number of lower triangular n X n arrays colored with integers 0 upwards introduced in row major order, with no element equal to any element within a city block distance of two, and containing the value n(n+1)/2-k-1.

Original entry on oeis.org

0, 0, 1, 0, 1, 4, 0, 0, 5, 19, 0, 0, 5, 119, 58, 0, 0, 5, 319, 1310, 136, 0, 0, 5, 447, 14949, 7849, 271, 0, 0, 0, 463, 94131, 253072, 32696, 484, 0, 0, 0, 463, 339764, 5054845, 2326567, 107400, 799, 0, 0, 0, 463, 728291, 65635205, 109065807, 14516200, 298404
Offset: 1

Views

Author

R. H. Hardin Apr 28 2012

Keywords

Comments

Table starts
...0......0........0..........0...........0...........0..........0...........0
...1......1........0..........0...........0...........0..........0...........0
...4......5........5..........5...........5...........0..........0...........0
..19....119......319........447.........463.........463........463.........463
..58...1310....14949......94131......339764......728291....1010440.....1087168
.136...7849...253072....5054845....65635205...566694913.3281785526.12771345347
.271..32696..2326567..109065807..3564578765.83865812963
.484.107400.14516200.1339229741.89579748909

Examples

			Some solutions for n=4 k=4
..0........0........0........0........0........0........0........0
..1.2......1.2......1.2......1.2......1.2......1.2......1.2......1.2
..3.4.1....3.4.1....3.4.5....3.0.4....3.0.4....3.4.1....3.4.0....3.4.5