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

 

Logo

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!)
A205517 Number of (n+1) X 6 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor. 1

%I

%S 35577,864948,27630789,825828828,25618992453,764670893556,

%T 23817299324910,709372088422890,22102921087553340,658465356466048596,

%U 20513506300848143013,611133044545340195310,19039149809165434333251

%N Number of (n+1) X 6 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.

%C Column 5 of A205520.

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

%e Some solutions for n=4

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

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

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

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

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

%Y Cf. A205520.

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 28 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 December 2 08:36 EST 2022. Contains 358493 sequences. (Running on oeis4.)