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

%I #7 Jun 18 2022 23:04:06

%S 11776,22568,40144,89600,184144,459536,1062832,2873552,7275856,

%T 20859728,56503984,169327760,482451664,1496230736,4431395632,

%U 14119144592,43104667216,140303136848,438787720624,1452514539920,4631009477584

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

%C Column 5 of A235319.

%H R. H. Hardin, <a href="/A235316/b235316.txt">Table of n, a(n) for n = 1..176</a>

%F Empirical: a(n) = 4*a(n-1) +47*a(n-2) -200*a(n-3) -901*a(n-4) +4204*a(n-5) +8957*a(n-6) -48440*a(n-7) -47194*a(n-8) +334096*a(n-9) +101948*a(n-10) -1410080*a(n-11) +170136*a(n-12) +3549696*a(n-13) -1446912*a(n-14) -4861440*a(n-15) +2954880*a(n-16) +2764800*a(n-17) -2073600*a(n-18).

%e Some solutions for n=4:

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

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

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

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

%e 2 5 3 6 3 4 6 0 5 1 5 1 6 2 6 2 4 2 5 0 4 1 5 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 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)