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

%I

%S 17920,597288,22414008,843904488,31625643196,1185601231024,

%T 44457471151176,1666962268642872,62503467236310480,

%U 2343599232293623768,87874636404562102448,3294903243596850745368,123544317033939549370912

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

%C Column 3 of A205466

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

%e Some solutions for n=4

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

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

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

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

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

%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 September 30 09:36 EDT 2022. Contains 357104 sequences. (Running on oeis4.)