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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A255102 Number of length n+3 0..2 arrays with at most one downstep in every 3 consecutive neighbor pairs. 2
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
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
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 14 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 17 21:15 EDT 2024. Contains 374377 sequences. (Running on oeis4.)