A255102 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A255102

Number of length n+3 0..2 arrays with at most one downstep in every 3 consecutive neighbor pairs.

66, 168, 441, 1137, 2907, 7498, 19338, 49698, 127871, 329325, 847491, 2180700, 5613144, 14447250, 37180603, 95692059, 246288681, 633868172, 1631378124, 4198705332, 10806224445, 27811942767, 71579710341, 184225016494

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Column 3 of A255107.

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

FORMULA

Empirical: a(n) = 3*a(n-1) -3*a(n-2) +8*a(n-3) -9*a(n-4) +3*a(n-5) -a(n-6).

Empirical g.f.: x*(66 - 30*x + 135*x^2 - 210*x^3 + 69*x^4 - 26*x^5) / ((1 - x)*(1 - 2*x + x^2 - 7*x^3 + 2*x^4 - x^5)). - Colin Barker, Jan 24 2018

EXAMPLE

Some solutions for n=4:

..0....2....0....2....2....1....0....0....0....2....2....0....0....0....0....2

..1....1....2....1....0....1....2....1....2....2....0....0....1....1....0....0

..0....1....0....1....1....1....0....0....2....2....0....0....1....2....0....0

..2....1....0....1....2....2....1....0....2....2....1....1....0....0....1....1

..2....2....1....1....1....2....1....2....2....2....1....2....0....0....2....0

..1....1....1....1....1....0....0....2....2....2....1....1....0....2....1....0

..2....2....0....0....2....2....1....1....1....1....1....1....1....2....2....1

CROSSREFS

Cf. A255107.

Sequence in context: A044398 A044779 A249284 * A202647 A202640 A074873

Adjacent sequences: A255099 A255100 A255101 * A255103 A255104 A255105

KEYWORD

nonn

AUTHOR

R. H. Hardin, Feb 14 2015

STATUS

approved