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

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

%S 1824,5612,17448,56936,188040,648536,2264904,8215256,30142344,

%T 114224792,436849608,1716521816,6787144200,27449810456,111385692744,

%U 460731399896,1906999712904,8026422662552,33728591085768,143889611473496

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

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

%F Empirical: a(n) = 9*a(n-1) +20*a(n-2) -390*a(n-3) +460*a(n-4) +5520*a(n-5) -14240*a(n-6) -26400*a(n-7) +115776*a(n-8) -13824*a(n-9) -299520*a(n-10) +276480*a(n-11).

%e Some solutions for n=5:

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

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

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

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

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

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

%Y Column 3 of A234227.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 21 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 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)