The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206077 Number of (n+1)X(n+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one 0

%I

%S 124,13672,4379116,3974151636,9872088702792,66942855421767116,

%T 1235464317731532811636,62111169401391445609577832

%N Number of (n+1)X(n+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one

%C Diagonal of A206085

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 03 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.

Last modified November 29 01:35 EST 2022. Contains 358421 sequences. (Running on oeis4.)