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!)
A234243 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 2 (constant-stress 1 X 1 tilings). 1

%I #6 Jun 20 2022 01:27:09

%S 72616,1520024,32965378,725628904,16021165696,354931091338,

%T 7860119921126,174432581257432,3867909998650764,85938055271287920,

%U 1907697414837426570,42433568115687443458,942986024965772638510,20999313840564845514606

%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 2 (constant-stress 1 X 1 tilings).

%H R. H. Hardin, <a href="/A234243/b234243.txt">Table of n, a(n) for n = 1..130</a>

%e Some solutions for n=1:

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

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

%Y Column 3 of A234245.

%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 July 5 14:27 EDT 2024. Contains 374026 sequences. (Running on oeis4.)