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!)
A234449 Number of (n+1) X (6+1) 0..4 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 00:13:28

%S 3137920,170001402,10079824144,627437990794,39720806964788,

%T 2548197407150290,163772796220260584,10589006000192373618,

%U 683462930964952700304,44310666343515542796718,2864896872318574609384464

%N Number of (n+1) X (6+1) 0..4 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="/A234449/b234449.txt">Table of n, a(n) for n = 1..20</a>

%e Some solutions for n=1:

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

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

%Y Column 6 of A234450.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 26 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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)