login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A266600 Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its north or northeast neighbor modulo 3 and the upper left element equal to 0. 2
1, 2, 6, 20, 83, 410, 2109, 11097, 59698, 325240, 1786820, 9888567, 55061514, 308166631, 1732444205, 9777801332, 55377818912, 314616215640, 1792424007975, 10237590562396, 58607205582421, 336211631539125, 1932440491804486 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Row 3 of A266599.

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..102

EXAMPLE

Some solutions for n=4

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

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

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

CROSSREFS

Cf. A266599.

Sequence in context: A260788 A115084 A177476 * A177474 A177480 A089179

Adjacent sequences:  A266597 A266598 A266599 * A266601 A266602 A266603

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 01 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 18 02:32 EST 2019. Contains 320237 sequences. (Running on oeis4.)