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

%I #6 Jun 20 2022 18:17:09

%S 13056,203008,3271560,53812604,886832036,14698619604,243143542208,

%T 4038567639984,66909511664976,1112993440706864,18463328032062420,

%U 307559050379497960,5108531833472596748,85219174193834018396

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

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

%e Some solutions for n=1:

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

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

%Y Column 4 of A234333.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 23 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 13:30 EDT 2024. Contains 371957 sequences. (Running on oeis4.)