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

%I #6 Jun 20 2022 19:39:57

%S 20416,184816,1659728,15022720,135896344,1236987584,11259287952,

%T 103178794676,945421176696,8728777849856,80564597517120,

%U 749961596817872,6976731437481296,65526946754262876,614749169773668664

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

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

%e Some solutions for n=2:

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

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

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

%Y Column 3 of A234555.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 28 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 03:44 EDT 2024. Contains 375759 sequences. (Running on oeis4.)