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!)
A217879 Number of n element 0..2 arrays with each element the minimum of 4 adjacent elements of a random 0..2 array of n+3 elements. 1
3, 9, 22, 46, 86, 153, 274, 511, 993, 1966, 3880, 7558, 14544, 27819, 53226, 102217, 197056, 380656, 735334, 1418931, 2734793, 5267460, 10145106, 19545576, 37670258, 72617646, 139990248, 269844980, 520094648, 1002351809, 1931757285, 3723025114 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 4 of A217883.

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) + a(n-3) + 3*a(n-5) - a(n-6) + a(n-7) + a(n-8) + a(n-9).

Empirical g.f.: x*(1 + x^2 + x^3 + x^4)*(3 + x^2 + x^3 + x^4) / (1 - 3*x + 3*x^2 - x^3 - 3*x^5 + x^6 - x^7 - x^8 - x^9). - Colin Barker, Jul 23 2018

EXAMPLE

Some solutions for n=4:

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

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

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

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

CROSSREFS

Cf. A217883.

Sequence in context: A217882 A217881 A217880 * A217878 A192389 A187053

Adjacent sequences: A217876 A217877 A217878 * A217880 A217881 A217882

KEYWORD

nonn

AUTHOR

R. H. Hardin, Oct 14 2012

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 February 7 02:40 EST 2023. Contains 360111 sequences. (Running on oeis4.)