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!)
A209952 Number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having one, three or four distinct clockwise edge differences 1

%I #6 Mar 31 2012 12:37:30

%S 71,12161,14922177,131724081683,8356768819356343,

%T 3811099763671947037073,12493316536665519357482808705,

%U 294391907024716464395174365141711571,49864726192803453135807335081496483729871063

%N Number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having one, three or four distinct clockwise edge differences

%C Diagonal of A209960

%H R. H. Hardin, <a href="/A209952/b209952.txt">Table of n, a(n) for n = 1..12</a>

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 16 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:19 EDT 2024. Contains 375085 sequences. (Running on oeis4.)