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!)
 A234824 Number of (n+1)X(n+1) 0..2 arrays with each 2X2 subblock having the number of clockwise edge increases less than or equal to the number of counterclockwise edge increases 1

%I

%S 69,9207,6566460,24157113543,449708506898208,41871771443346465840,

%T 19350145309183022128305720,44147611144852903747954064790315,

%U 495356111860226608697583545499495505848

%N Number of (n+1)X(n+1) 0..2 arrays with each 2X2 subblock having the number of clockwise edge increases less than or equal to the number of counterclockwise edge increases

%C Diagonal of A234832

%H R. H. Hardin, <a href="/A234824/b234824.txt">Table of n, a(n) for n = 1..10</a>

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 31 2013

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 December 9 10:59 EST 2022. Contains 358700 sequences. (Running on oeis4.)