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

%I #6 Jun 20 2022 18:50:07

%S 2380,6282,15224,47136,131704,443220,1352816,4791948,15484360,

%T 56779452,190677584,716514876,2473383304,9461029980,33344399696,

%U 129230455548,462955104520,1811799391452,6576906075344,25926079006716,95144821863304

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

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

%F Empirical: a(n) = 8*a(n-1) +60*a(n-2) -620*a(n-3) -1210*a(n-4) +20740*a(n-5) +1580*a(n-6) -392180*a(n-7) +353267*a(n-8) +4606324*a(n-9) -7135240*a(n-10) -34677440*a(n-11) +72387960*a(n-12) +165390560*a(n-13) -443380480*a(n-14) -464032320*a(n-15) +1696321584*a(n-16) +566607168*a(n-17) -3948347520*a(n-18) +465384960*a(n-19) +5084985600*a(n-20) -2142028800*a(n-21) -2757888000*a(n-22) +1741824000*a(n-23).

%e Some solutions for n=5:

%e 4 3 4 0 5 0 5 0 3 6 3 6 3 6 2 6 3 5 3 5

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

%e 4 3 4 0 5 0 5 0 0 3 0 3 3 6 2 6 0 2 0 2

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

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

%e 0 5 0 2 1 2 1 2 3 0 3 0 3 0 2 0 6 2 6 2

%Y Column 3 of A234823.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 31 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 September 9 21:41 EDT 2024. Contains 375765 sequences. (Running on oeis4.)