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

%I #8 Jun 19 2022 01:06:39

%S 4568,9108,17312,41832,93680,254784,639440,1878960,5098448,15829008,

%T 45291152,146459472,434549840,1448936784,4409332880,15047298000,

%U 46627861328,161947291728,508508258192,1789849512912,5675323653200

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

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

%F Empirical: a(n) = 4*a(n-1) +47*a(n-2) -200*a(n-3) -901*a(n-4) +4204*a(n-5) +8957*a(n-6) -48440*a(n-7) -47194*a(n-8) +334096*a(n-9) +101948*a(n-10) -1410080*a(n-11) +170136*a(n-12) +3549696*a(n-13) -1446912*a(n-14) -4861440*a(n-15) +2954880*a(n-16) +2764800*a(n-17) -2073600*a(n-18).

%e Some solutions for n=5

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

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

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

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

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

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

%Y Column 4 of A234681.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 29 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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)