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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A234778 Number of (n+1)X(n+1) 0..3 arrays with no adjacent elements equal and with each 2X2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases 1

%I

%S 76,6660,2761748,5465582060,51845281856108,2363085244017636364,

%T 518342328616619031217020,547728179121316322465056282212,

%U 2790190676549838064460970840259520660

%N Number of (n+1)X(n+1) 0..3 arrays with no adjacent elements equal and with each 2X2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases

%C Diagonal of A234786

%H R. H. Hardin, <a href="/A234778/b234778.txt">Table of n, a(n) for n = 1..10</a>

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 30 2013

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 29 09:18 EST 2021. Contains 349416 sequences. (Running on oeis4.)