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

%I #13 Jun 20 2022 21:34:11

%S 568,5260,48592,449880,4160672,38547120,356781376,3308068320,

%T 30642026624,284343188160,2635852305664,24479566880640,

%U 227101552312832,2110876497027840,19598341417366528,182315530807365120

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

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

%F Empirical: a(n) = 182*a(n-2) - 9024*a(n-4) + 66960*a(n-6).

%F Empirical g.f.: 4*x*(142 + 1315*x - 13696*x^2 - 126860*x^3 + 110640*x^4 + 1033800*x^5) / ((1 - 90*x^2)*(1 - 92*x^2 + 744*x^4)). - _Colin Barker_, Oct 14 2018

%e Some solutions for n=3:

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

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

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

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

%Y Column 1 of A234233.

%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 August 30 17:27 EDT 2024. Contains 375545 sequences. (Running on oeis4.)