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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A267164 Number of 3 X n arrays containing n copies of 0..3-1 with no element 1 greater than its west, southwest or northwest neighbor modulo 3 and the upper left element equal to 0. 2
 2, 0, 1, 15, 65, 202, 537, 1559, 6506, 27557, 104122, 360598, 1236670, 4479897, 16998081, 64623235, 240399786, 880495525, 3233751496, 12035510317, 45240963675, 170207777737, 637838570111, 2384646622991, 8931032553574 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Row 3 of A267163. LINKS R. H. Hardin, Table of n, a(n) for n = 1..89 EXAMPLE Some solutions for n=4 ..0..2..1..1....0..2..1..0....0..0..2..2....0..0..2..1....0..2..2..1 ..0..2..2..1....2..2..1..0....1..0..2..1....0..2..2..1....0..0..2..1 ..0..0..2..1....2..1..1..0....1..0..2..1....0..2..1..1....1..0..2..1 CROSSREFS Cf. A267163. Sequence in context: A322221 A328924 A217654 * A158234 A270882 A278778 Adjacent sequences:  A267161 A267162 A267163 * A267165 A267166 A267167 KEYWORD nonn AUTHOR R. H. Hardin, Jan 11 2016 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 May 21 00:36 EDT 2022. Contains 353886 sequences. (Running on oeis4.)