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

%I #10 Jun 18 2022 23:19:58

%S 70,210,518,1554,4006,12018,32006,96018,261670,785010,2173958,6521874,

%T 18267046,54801138,154764806,464294418,1319524390,3958573170,

%U 11307598598,33922795794,97317170086,291951510258,840713542406,2522140627218

%N Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 6 (constant-stress 1 X 1 tilings).

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

%F Empirical: a(n) = 3*a(n-1) + 13*a(n-2) - 39*a(n-3) - 40*a(n-4) + 120*a(n-5).

%F Empirical g.f.: 2*x*(35 - 511*x^2 + 1800*x^4) / ((1 - 3*x)*(1 - 5*x^2)*(1 - 8*x^2)). - _Colin Barker_, Oct 18 2018

%e Some solutions for n=5:

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

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

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

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

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

%e 3 0 0 2 1 4 1 4 0 4 2 4 3 0 0 4 1 3 0 4

%Y Column 1 of A235310.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 05 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 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)