login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A234174 Number of (n+1) X (5+1) 0..6 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 19 2022 01:54:09

%S 5630848,354809676,25133134704,1898311922200,148522072535416,

%T 11873684734291952,960955500498528728,78414010788653239964,

%U 6426902198019733695464,528592241082676662032908

%N Number of (n+1) X (5+1) 0..6 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="/A234174/b234174.txt">Table of n, a(n) for n = 1..16</a>

%e Some solutions for n=1:

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

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

%Y Column 5 of A234175.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 20 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 December 5 19:46 EST 2023. Contains 367593 sequences. (Running on oeis4.)