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!)
A234793 Number of (n+1)X(5+1) 0..3 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 #4 Dec 30 2013 19:30:19

%S 4530424,3479085232,2334950105532,1482624037868512,919194890082815688,

%T 563911503226583454576,344333604652481774211624,

%U 209816009600794690981704160,127729390902192242280754534880

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

%C Column 5 of A234796

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

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 30 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)