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

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A269645 Number of nX3 arrays containing 3 copies of 0..n-1 avoiding the pattern down-up in every row and equal-up in every column. 0
1, 14, 574, 68876, 18375702, 9213264418, 7725775442284 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Column 3 of A269646.

LINKS

Table of n, a(n) for n=1..7.

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A269646.

Sequence in context: A002010 A166185 A269478 * A232369 A218412 A129007

Adjacent sequences:  A269642 A269643 A269644 * A269646 A269647 A269648

KEYWORD

nonn

AUTHOR

R. H. Hardin, Mar 02 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 November 30 21:20 EST 2021. Contains 349426 sequences. (Running on oeis4.)