A268073 T(n,k)=Number of nXk 0..3 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order.
1, 2, 2, 4, 15, 4, 12, 159, 159, 12, 39, 2191, 7445, 2191, 39, 138, 30295, 381958, 381958, 30295, 138, 499, 421471, 18691624, 70985206, 18691624, 421471, 499, 1830, 5797959, 911680225, 12341773443, 12341773443, 911680225, 5797959, 1830, 6723, 79367143
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..1..0....0..1..1..2....0..0..1..2....0..1..1..0....0..0..1..2 ..0..1..2..2....0..1..2..3....0..1..0..3....0..2..1..1....0..3..0..1 ..3..1..1..2....1..3..2..0....3..1..0..1....2..2..0..1....2..2..1..2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..60
Crossrefs
Column 3 is A268007.
Formula
Empirical for column k:
k=1: a(n) = 6*a(n-1) -3*a(n-2) -30*a(n-3) +28*a(n-4) +36*a(n-5) -36*a(n-6) for n>8
k=2: [order 11] for n>13
k=3: [order 75]
Comments