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!)
A234241 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 2 (constant-stress 1 X 1 tilings). 1

%I #7 Jun 20 2022 19:08:06

%S 630,6706,72616,790718,8612920,93934380,1023822944,11170450750,

%T 121790634482,1329240620840,14497107132750,158275185584352,

%U 1726726741846356,18858007382510560,205796722132646470

%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 2 (constant-stress 1 X 1 tilings).

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

%F Empirical: a(n) = 7*a(n-1) +181*a(n-2) -1022*a(n-3) -7657*a(n-4) +21504*a(n-5) +54144*a(n-6) -96768*a(n-7) -80640*a(n-8).

%e Some solutions for n=3:

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

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

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

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

%Y Column 1 of A234245.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 21 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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)