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!)
A234561 Number of (n+1) X (5+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). 1

%I #6 Jun 20 2022 19:33:02

%S 5506,8416,12750,23830,42982,94114,195558,479914,1108726,2964106,

%T 7385190,21074650,55254742,165527434,448561158,1392113914,3852440566,

%U 12264562666,34393441830,111531402970,315410580502,1036750071754,2947674917958

%N Number of (n+1) X (5+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).

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

%F Empirical: a(n) = 4*a(n-1) +30*a(n-2) -132*a(n-3) -331*a(n-4) +1720*a(n-5) +1530*a(n-6) -11280*a(n-7) -1324*a(n-8) +39136*a(n-9) -12360*a(n-10) -67968*a(n-11) +39456*a(n-12) +46080*a(n-13) -34560*a(n-14).

%e Some solutions for n=5:

%e 1 4 1 4 0 4 0 2 0 2 0 2 1 2 1 4 1 4 0 1 0 1 0 0

%e 2 1 2 1 1 1 2 0 2 0 2 0 4 1 4 3 4 3 4 1 4 1 4 0

%e 1 4 1 4 0 4 0 2 0 2 0 2 1 2 1 4 1 4 2 3 2 3 2 2

%e 4 3 4 3 3 3 2 0 2 0 2 0 3 0 3 2 3 2 4 1 4 1 4 0

%e 1 4 1 4 0 4 2 4 2 4 2 4 0 1 0 3 0 3 3 4 3 4 3 3

%e 1 0 1 0 0 0 2 0 2 0 2 0 3 0 3 2 3 2 4 1 4 1 4 0

%Y Column 5 of A234564.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 28 2013

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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)