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.

A217273 T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or vertical neighbor.

Original entry on oeis.org

0, 1, 1, 2, 9, 2, 4, 64, 64, 4, 8, 441, 1472, 441, 8, 16, 3025, 33856, 33856, 3025, 16, 32, 20736, 772800, 2572816, 772800, 20736, 32, 64, 142129, 17640000, 194881600, 194881600, 17640000, 142129, 64, 128, 974169, 402494400, 14755689729
Offset: 1

Views

Author

R. H. Hardin Sep 29 2012

Keywords

Comments

Table starts
....0..........1...............2..................4.....................8
....1..........9..............64................441..................3025
....2.........64............1472..............33856................772800
....4........441...........33856............2572816.............194881600
....8.......3025..........772800..........194881600...........48909857500
...16......20736........17640000........14755689729........12276607432401
...32.....142129.......402494400......1117092569476......3080781263731464
...64.....974169......9183772224.....84567501131481....773143936621737444
..128....6677056....209543184576...6401965110822961.194021789111058265560
..256...45765225...4781079618624.484642857129680209
..512..313679521.109088244863424
.1024.2149991424

Examples

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

Crossrefs

Column 2 is A049684