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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268364 Number of (2n-1) X 3 arrays containing 3 copies of 0..2n-2 with row sums equal. 0
1, 216, 116640, 535610880, 3614668001280, 89303801403801600, 2951593617355820236800 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Column 3 of A268367 (odd terms)
LINKS
EXAMPLE
Some solutions for n=3
..0..4..2....1..2..3....0..3..3....2..3..1....3..2..1....2..3..1....1..2..3
..3..0..3....1..4..1....2..4..0....0..2..4....1..1..4....4..1..1....0..4..2
..1..2..3....3..3..0....4..0..2....1..1..4....3..3..0....3..0..3....0..2..4
..0..2..4....2..0..4....4..1..1....0..4..2....2..0..4....0..2..4....1..4..1
..4..1..1....0..4..2....2..3..1....3..3..0....0..2..4....2..4..0....3..3..0
CROSSREFS
Cf. A268367.
Sequence in context: A134358 A167127 A269821 * A358657 A048100 A222337
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 03 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)