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!)
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

%I #4 Jan 26 2016 07:07:19

%S 8,192,4608,98830,2028304,40109966,774613334,14704721628,275789779530,

%T 5127593717314,94736825794120,1742377742866910,31939206633903848,

%U 584056036861579428,10661467774391724330,194364960910265681074

%N 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.

%C Row 3 of A268092.

%H R. H. Hardin, <a href="/A268095/b268095.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=4

%e ..0..2..1..0....0..2..0..2....0..2..0..2....0..1..2..1....0..2..0..0

%e ..2..2..2..2....2..0..2..0....0..0..0..0....0..0..0..2....2..1..2..2

%e ..0..1..0..0....2..1..0..2....1..1..2..1....2..2..2..2....1..1..1..1

%Y Cf. A268092.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 26 2016

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 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)