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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A218051 Number of n X 1 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random 0..3 n X 1 array. 5
 4, 4, 16, 36, 94, 236, 602, 1528, 3882, 9858, 25038, 63592, 161514, 410218, 1041884, 2646208, 6720920, 17069998, 43354902, 110114102, 279671154, 710317326, 1804085608, 4582071648, 11637685314, 29557748082, 75071670020, 190669317026 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 1 of A218056. LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 2*a(n-1) + a(n-2) + 2*a(n-4) + a(n-5). Empirical g.f.: 2*x*(2 - 2*x + 2*x^2 - x^4) / (1 - 2*x - x^2 - 2*x^4 - x^5). - Colin Barker, Feb 19 2018 EXAMPLE All solutions for n=3: ..2....0....3....2....3....2....3....2....0....1....1....1....1....3....0....0 ..1....0....3....2....2....2....1....0....0....1....1....1....0....0....0....0 ..1....0....3....3....2....2....1....0....2....2....3....1....0....0....1....3 CROSSREFS Sequence in context: A158101 A038234 A099462 * A092266 A257606 A219398 Adjacent sequences: A218048 A218049 A218050 * A218052 A218053 A218054 KEYWORD nonn AUTHOR R. H. Hardin, Oct 19 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.

Last modified December 1 17:49 EST 2022. Contains 358475 sequences. (Running on oeis4.)