login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A258729
Number of length n+7 0..3 arrays with at most one downstep in every 7 consecutive neighbor pairs
1
5115, 10280, 22866, 55660, 138196, 331584, 752180, 1607656, 3343894, 7100132, 15867680, 37057120, 87647408, 203774064, 457583316, 996246248, 2145967651, 4684383672, 10501666108, 24080284440, 55579151729, 126886388888
OFFSET
1,1
COMMENTS
Column 7 of A258730
LINKS
FORMULA
Empirical: a(n) = 4*a(n-1) -6*a(n-2) +4*a(n-3) -a(n-4) +116*a(n-7) -303*a(n-8) +268*a(n-9) -80*a(n-10) -206*a(n-14) +320*a(n-15) -125*a(n-16) +20*a(n-21) -10*a(n-22)
EXAMPLE
Some solutions for n=4
..0....3....1....1....1....2....3....1....2....0....3....1....3....1....2....0
..0....0....2....1....0....1....0....0....2....2....3....1....1....2....2....0
..3....1....2....0....0....1....0....1....2....2....0....1....2....0....2....2
..1....1....1....0....1....1....0....1....2....1....0....1....2....0....1....2
..1....2....2....0....2....2....0....1....3....1....0....0....2....0....1....0
..1....2....2....2....2....2....0....3....3....1....2....0....2....0....2....1
..1....2....2....2....3....2....0....3....0....1....2....0....2....0....2....2
..2....2....2....2....3....2....2....3....1....2....3....0....3....0....2....2
..2....3....2....2....2....2....2....2....3....3....3....2....0....1....3....2
..3....3....3....2....2....3....3....2....3....3....3....3....0....0....3....2
..2....0....1....0....3....1....3....3....3....0....1....3....1....0....0....3
CROSSREFS
Sequence in context: A255209 A261462 A215839 * A259425 A195653 A187030
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jun 08 2015
STATUS
approved