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!)
A235307 Number of (n+1) X (5+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 #7 Jun 18 2022 23:19:42

%S 4006,6786,10790,21090,38182,83394,168998,400674,889126,2238786,

%T 5323430,14015010,35074342,95480514,248156198,692867874,1852387366,

%U 5272270146,14401045670,41585674530,115480062502,337084349634,948148162598

%N Number of (n+1) X (5+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).

%C Column 5 of A235310.

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

%F Empirical: a(n) = 4*a(n-1) +25*a(n-2) -112*a(n-3) -231*a(n-4) +1260*a(n-5) +875*a(n-6) -7280*a(n-7) -224*a(n-8) +22736*a(n-9) -7980*a(n-10) -36288*a(n-11) +21456*a(n-12) +23040*a(n-13) -17280*a(n-14).

%e Some solutions for n=5:

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

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

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

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

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

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

%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 18 20:18 EDT 2024. Contains 371781 sequences. (Running on oeis4.)