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.

A206503 T(n,k)=Number of nXk 0..7 arrays with no element equal to another within a city block distance of two, and new values 0..7 introduced in row major order.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 4, 4, 2, 5, 34, 65, 34, 5, 15, 481, 3130, 3130, 481, 15, 52, 8731, 178998, 502599, 178998, 8731, 52, 203, 174454, 10502458, 83045488, 83045488, 10502458, 174454, 203, 876, 3603244, 618242826, 13752277898, 38638317841, 13752277898
Offset: 1

Views

Author

R. H. Hardin Feb 08 2012

Keywords

Comments

Table starts
...1.......1.........1...........2...........5..........15............52
...1.......1.........4..........34.........481........8731........174454
...1.......4........65........3130......178998....10502458.....618242826
...2......34......3130......502599....83045488.13752277898.2277207309720
...5.....481....178998....83045488.38638317841
..15....8731..10502458.13752277898
..52..174454.618242826
.203.3603244

Examples

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

Crossrefs

Column 1 is A056273(n-2)
Column 2 is A198976(n-1)