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!)
A205907 Number of (n+1)X7 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock the same 1

%I #5 Mar 31 2012 12:37:07

%S 218034,14747754,900968550,54239297565,3239997622134,193311671549253,

%T 11531150817716439,687972941078892735,41053554906467576118,

%U 2450149123223008268094,146242537144665869218068

%N Number of (n+1)X7 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock the same

%C Column 6 of A205909

%H R. H. Hardin, <a href="/A205907/b205907.txt">Table of n, a(n) for n = 1..153</a>

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 01 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 14 10:49 EDT 2024. Contains 375921 sequences. (Running on oeis4.)