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

%I

%S 288,1828,11976,79848,534008,3577048,23966856,160608008,1076281720,

%T 7212695512,48335145928,323918665128,2170711158968,14547055076472,

%U 97485766228616,653302411496072,4378046742831096,29339549842789400

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

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

%F Empirical: a(n) = 61*a(n-2) -813*a(n-4) +4271*a(n-6) -9694*a(n-8) +8264*a(n-10) -1536*a(n-12).

%e Some solutions for n=4:

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

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

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

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

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

%Y Column 1 of A235078.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 03 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 October 5 05:10 EDT 2022. Contains 357252 sequences. (Running on oeis4.)