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!)
A205463 Number of (n+1)X6 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock differing from each horizontal or vertical neighbor 1

%I

%S 1285076,177411808,31625643196,5649505038240,1002427910938748,

%T 178097908817359584,31646417127980445980,5622608157648351746032,

%U 998989343977996317875992,177494036170870526426806232

%N Number of (n+1)X6 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock differing from each horizontal or vertical neighbor

%C Column 5 of A205466

%H R. H. Hardin, <a href="/A205463/b205463.txt">Table of n, a(n) for n = 1..43</a>

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 27 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 August 12 08:40 EDT 2022. Contains 356067 sequences. (Running on oeis4.)