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

%I #7 Jun 07 2021 15:03:28

%S 151824,10306944,843904488,69248994984,5649505038240,461355684937208,

%T 37682835967710128,3077546846103277112,251344006886622665336,

%U 20527456988785057420264,1676490653874059039862192

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

%C Column 4 of A205466.

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

%e Some solutions for n=4

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

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

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

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

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

%Y Cf. A205466.

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 27 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 6 20:19 EDT 2024. Contains 375727 sequences. (Running on oeis4.)