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.

A206692 T(n,k)=Number of nXk 0..3 arrays with no element equal to another within two positions in the same row or column, and new values 0..3 introduced in row major order.

Original entry on oeis.org

1, 1, 1, 1, 4, 1, 2, 11, 11, 2, 4, 36, 44, 36, 4, 8, 116, 176, 176, 116, 8, 16, 376, 704, 916, 704, 376, 16, 32, 1216, 2816, 4704, 4704, 2816, 1216, 32, 64, 3936, 11264, 24492, 31504, 24492, 11264, 3936, 64, 128, 12736, 45056, 127008, 213788, 213788, 127008
Offset: 1

Views

Author

R. H. Hardin Feb 11 2012

Keywords

Comments

Table starts
..1....1.....1......2.......4.........8.........16..........32...........64
..1....4....11.....36.....116.......376.......1216........3936........12736
..1...11....44....176.....704......2816......11264.......45056.......180224
..2...36...176....916....4704.....24492.....127008......660888......3436488
..4..116...704...4704...31504....213788....1454810.....9933294.....67923354
..8..376..2816..24492..213788...1915580...17277556...156946368...1429962032
.16.1216.11264.127008.1454810..17277556..208563912..2543024548..31198656992
.32.3936.45056.660888.9933294.156946368.2543024548.41832855136.694325337444

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..0..1....1..2..3....1..2..3....3..2..1....1..2..3....1..3..0
..1..2..3....1..2..3....2..0..1....2..3..1....2..0..3....2..3..0....2..0..1
..3..0..1....0..3..2....3..1..2....0..1..2....0..1..2....0..1..2....3..1..2
		

Crossrefs

Column 3 is A002089(n-2)