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!)
A206198 Number of (n+1) X (n+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases. 0

%I #9 Jan 18 2018 09:51:28

%S 256,1060,5136,32920,118936,484704,3270240,11893600,48470400,

%T 327024000,1189360000,4847040000,32702400000,118936000000,

%U 484704000000,3270240000000,11893600000000,48470400000000,327024000000000

%N Number of (n+1) X (n+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases.

%C Diagonal of A206206.

%F Conjectures from _Colin Barker_, Jan 18 2018: (Start)

%F G.f.: 4*x*(64 + 265*x + 1284*x^2 + 1830*x^3 + 3234*x^4 - 7224*x^5 - 5440*x^6) / (1 - 100*x^3).

%F a(n) = 100*a(n-3) for n>7.

%F (End)

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 04 2012

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 May 9 09:02 EDT 2024. Contains 372346 sequences. (Running on oeis4.)