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

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

%S 16,168,5212,387328,67731268,27913330476,27149753088796,

%T 62383316832685352,338853014329060508764,4353185098169744392741452,

%U 132316928041105714306034574484,9518293354852895518368238072987356

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

%C Diagonal of A205255

%H R. H. Hardin, <a href="/A205247/b205247.txt">Table of n, a(n) for n = 1..14</a>

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 24 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 February 26 07:39 EST 2024. Contains 370335 sequences. (Running on oeis4.)