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!)
A234669 Number of (n+1) X (3+1) 0..7 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 #7 Jun 20 2022 18:42:58

%S 29568,217968,1604020,11826092,87273500,644848264,4769561472,

%T 35319420856,261811840168,1942988877232,14433959951680,

%U 107349012026192,799169229326556,5956201429623128,44434739229424040,331862990142839740

%N Number of (n+1) X (3+1) 0..7 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="/A234669/b234669.txt">Table of n, a(n) for n = 1..154</a>

%e Some solutions for n=1:

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

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

%Y Column 3 of A234672.

%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 08:48 EDT 2024. Contains 371930 sequences. (Running on oeis4.)