A264945 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.
1, 0, 1, 0, 2, 1, 0, 1, 8, 1, 0, 2, 56, 60, 1, 0, 1, 332, 3201, 544, 1, 0, 2, 2350, 184740, 307016, 6040, 1, 0, 1, 16108, 11375145, 196389904, 43200625, 79008, 1, 0, 2, 114148, 730983420, 137409486772, 368696849320, 8403205056, 1190672, 1, 0, 1, 817280
Offset: 1
Examples
Some solutions for n=4 k=4 ..0..1..0..2....0..1..0..1....0..1..2..0....0..1..0..2....0..1..2..0 ..0..1..0..2....2..3..1..0....3..0..3..2....1..0..2..0....3..2..1..2 ..2..3..1..3....0..1..2..3....1..2..0..2....1..3..2..3....1..2..3..0 ..3..1..3..2....3..2..3..2....3..1..3..1....3..1..3..2....3..0..3..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..66
Crossrefs
Column 2 is A053871.
Comments