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”).

A255104
Number of length n+5 0..2 arrays with at most one downstep in every 5 consecutive neighbor pairs.
1
294, 597, 1302, 2951, 6582, 14001, 29147, 61542, 133392, 292534, 634197, 1353282, 2874273, 6149472, 13283988, 28746325, 61881375, 132509427, 283590718, 609038592, 1311917331, 2825639015, 6072583563, 13028913003, 27962048781
OFFSET
1,1
COMMENTS
Column 5 of A255107.
LINKS
FORMULA
Empirical: a(n) = 3*a(n-1) -3*a(n-2) +a(n-3) +18*a(n-5) -29*a(n-6) +12*a(n-7) -6*a(n-10) +3*a(n-11).
Empirical g.f.: x*(294 - 285*x + 393*x^2 + 542*x^3 + 1038*x^4 - 3486*x^5 + 1719*x^6 - 129*x^7 - 318*x^8 - 684*x^9 + 441*x^10) / (1 - 3*x + 3*x^2 - x^3 - 18*x^5 + 29*x^6 - 12*x^7 + 6*x^10 - 3*x^11). - Colin Barker, Jan 24 2018
EXAMPLE
Some solutions for n=4:
..2....0....0....2....1....1....1....0....0....0....2....1....1....0....2....0
..0....0....1....0....2....1....1....0....0....0....2....1....1....1....0....2
..1....0....1....0....0....0....1....1....1....2....1....2....0....1....0....2
..1....0....2....0....1....0....2....0....1....2....1....0....1....2....1....2
..1....1....0....1....1....1....1....1....1....2....1....1....1....2....1....2
..1....1....2....1....1....1....1....1....1....2....1....2....2....2....1....0
..0....0....2....1....1....2....1....1....1....1....1....2....2....0....0....1
..0....0....2....1....0....1....2....2....1....1....2....2....0....1....0....1
..2....2....2....0....0....1....2....2....1....1....2....0....0....1....0....1
CROSSREFS
Cf. A255107.
Sequence in context: A153579 A132187 A367207 * A212724 A235948 A250752
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 14 2015
STATUS
approved