A217883 T(n,k) = number of n-element 0..2 arrays with each element the minimum of k adjacent elements of a random 0..2 array of n+k-1 elements.
3, 3, 9, 3, 9, 27, 3, 9, 22, 81, 3, 9, 22, 51, 243, 3, 9, 22, 46, 121, 729, 3, 9, 22, 46, 91, 292, 2187, 3, 9, 22, 46, 86, 183, 704, 6561, 3, 9, 22, 46, 86, 153, 383, 1691, 19683, 3, 9, 22, 46, 86, 148, 274, 819, 4059, 59049, 3, 9, 22, 46, 86, 148, 244, 511, 1749, 9749, 177147
Offset: 1
Examples
Some solutions for n=4 k=4 ..0....0....2....1....0....0....1....2....0....2....2....1....0....2....1....1 ..2....2....2....1....0....0....1....1....1....2....1....2....2....2....1....2 ..1....2....2....1....0....2....2....0....2....2....1....2....2....2....2....2 ..0....0....0....1....1....0....1....0....0....2....1....1....2....1....0....2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..902
Formula
Empirical for column k:
k=2: a(n) = 3*a(n-1) -3*a(n-2) +4*a(n-3) -a(n-4) +a(n-5)
k=3: a(n) = 3*a(n-1) -3*a(n-2) +a(n-3) +3*a(n-4) -a(n-5) +a(n-6) +a(n-7)
k=4: a(n) = 3*a(n-1) -3*a(n-2) +a(n-3) +3*a(n-5) -a(n-6) +a(n-7) +a(n-8) +a(n-9)
k=5: a(n) = 3*a(n-1) -3*a(n-2) +a(n-3) +3*a(n-6) -a(n-7) +a(n-8) +a(n-9) +a(n-10) +a(n-11)
k=6: a(n) = 3*a(n-1) -3*a(n-2) +a(n-3) +3*a(n-7) -a(n-8) +a(n-9) +a(n-10) +a(n-11) +a(n-12) +a(n-13)
k=7: a(n) = 3*a(n-1) -3*a(n-2) +a(n-3) +3*a(n-8) -a(n-9) +a(n-10) +a(n-11) +a(n-12) +a(n-13) +a(n-14) +a(n-15)
Diagonal: a(n) = (1/24)*n^4 + (1/4)*n^3 + (23/24)*n^2 + (3/4)*n + 1
Comments