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!)
A234477 Number of (n+1) X (2+1) 0..7 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 #7 Jun 20 2022 01:26:01

%S 7840,141728,2765648,56172656,1165600828,24484032192,517788509004,

%T 10996717871928,234081623047024,4991134242744276,106505167261928932,

%U 2274481051607364768,48584502628043230124,1038273815225245627876

%N Number of (n+1) X (2+1) 0..7 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="/A234477/b234477.txt">Table of n, a(n) for n = 1..210</a>

%H R. H. Hardin, <a href="/A234477/a234477.txt">Empirical recurrence of order 46</a>

%F Empirical recurrence of order 46 (see link above).

%e Some solutions for n=2:

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

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

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

%Y Column 2 of A234481.

%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 March 29 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)