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!)
A186477 Number of (n+1)X5 0..3 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors 1

%I #5 Mar 31 2012 12:36:05

%S 1251,2049,4810,16762,25633,67714,101305,286290,456113,1219034,

%T 2037173,5189546,9017049,22136029,39734818,94665157,174517432,

%U 405721297,764487337,1742099164,3341954341,7491958474,14584990777,32261305429

%N Number of (n+1)X5 0..3 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors

%C Column 4 of A186482

%H R. H. Hardin, <a href="/A186477/b186477.txt">Table of n, a(n) for n = 1..200</a>

%F Empirical: a(n)=2*a(n-1)+2*a(n-2)-6*a(n-3)+6*a(n-4)-3*a(n-5) for n>15

%e Some solutions for 3X5

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 22 2011

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 23 19:56 EDT 2024. Contains 371916 sequences. (Running on oeis4.)