The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A266862 Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its north or southwest neighbor modulo 3 and the upper left element equal to 0. 2
 1, 4, 17, 66, 324, 1565, 7908, 41440, 219394, 1181538, 6433652, 35322999, 195435804, 1087909500, 6087937840, 34225256140, 193178201178, 1094225487556, 6217602330366, 35429358636014, 202398423255902, 1158911705466210 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Row 3 of A266861. LINKS R. H. Hardin, Table of n, a(n) for n = 1..105 EXAMPLE Some solutions for n=4 ..0..2..1..1....0..2..1..0....0..2..0..1....0..1..0..2....0..1..1..2 ..0..2..1..0....2..1..1..0....2..1..2..0....2..1..0..2....2..1..0..2 ..0..2..1..2....2..1..0..2....1..0..1..2....2..1..0..1....2..0..0..1 CROSSREFS Cf. A266861. Sequence in context: A291394 A244616 A030529 * A239845 A081113 A114587 Adjacent sequences:  A266859 A266860 A266861 * A266863 A266864 A266865 KEYWORD nonn AUTHOR R. H. Hardin, Jan 04 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 17:33 EST 2021. Contains 340247 sequences. (Running on oeis4.)