A255660 T(n,k)=Number of length n+k 0..3 arrays with at most two downsteps in every k consecutive neighbor pairs.
16, 64, 64, 255, 256, 256, 968, 1016, 1024, 1024, 3340, 3692, 4048, 4096, 4096, 10320, 11752, 14192, 16128, 16384, 16384, 28722, 33042, 42653, 54560, 64257, 65536, 65536, 72920, 83752, 112196, 155144, 209412, 256012, 262144, 262144, 171106, 195020
Offset: 1
Examples
Some solutions for n=4 k=4 ..3....1....2....2....3....2....0....1....1....2....2....0....1....1....2....3 ..0....1....0....2....0....0....0....3....2....3....2....3....0....2....0....1 ..2....1....2....3....2....1....1....1....0....1....1....1....0....1....0....1 ..0....2....1....3....3....2....2....1....1....3....2....1....2....0....2....0 ..0....1....3....3....0....3....3....1....3....3....0....0....0....0....2....0 ..0....3....0....1....0....0....1....2....1....3....2....3....1....3....1....3 ..0....3....2....2....1....3....2....0....1....3....0....3....0....2....3....2 ..0....2....2....1....1....3....3....2....3....2....1....1....1....3....2....2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..9999
Formula
Empirical for column k:
k=1: a(n) = 4*a(n-1)
k=2: a(n) = 4*a(n-1)
k=3: a(n) = 4*a(n-1) -a(n-4)
k=4: [order 12]
k=5: [order 24]
k=6: [order 35]
k=7: [order 48]
Empirical for row n:
n=1: [polynomial of degree 11]
n=2: [polynomial of degree 11]
n=3: [polynomial of degree 11] for n>1
n=4: [polynomial of degree 11] for n>2
n=5: [polynomial of degree 11] for n>3
n=6: [polynomial of degree 11] for n>4
n=7: [polynomial of degree 11] for n>5
Comments