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!)
A234909 Number of (n+1) X (5+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). 1

%I #6 Jun 20 2022 01:23:57

%S 395992,5287952,66054728,1035687060,15595734400,268581208108,

%T 4410133393168,80151723302880,1370941526247760,25729462123401132,

%U 449038140756511800,8617212783826638192,152081237998449308184

%N Number of (n+1) X (5+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).

%H R. H. Hardin, <a href="/A234909/b234909.txt">Table of n, a(n) for n = 1..30</a>

%e Some solutions for n=1:

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

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

%Y Column 5 of A234911.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 01 2014

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 19 16:38 EDT 2024. Contains 371794 sequences. (Running on oeis4.)