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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268095 Number of 3Xn 0..2 arrays with every repeated value in every row not one larger and in every column one larger mod 3 than the previous repeated value, and upper left element zero. 1
8, 192, 4608, 98830, 2028304, 40109966, 774613334, 14704721628, 275789779530, 5127593717314, 94736825794120, 1742377742866910, 31939206633903848, 584056036861579428, 10661467774391724330, 194364960910265681074 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Row 3 of A268092.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

CROSSREFS

Cf. A268092.

Sequence in context: A129004 A267948 A189537 * A058873 A052734 A003435

Adjacent sequences:  A268092 A268093 A268094 * A268096 A268097 A268098

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 26 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 December 11 04:29 EST 2018. Contains 318049 sequences. (Running on oeis4.)