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!)
A235300 Number of (n+1) X (10+1) 0..3 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

%S 274368,290932,312416,356632,420816,553552,768272,1215520,2006448,

%T 3677632,6842576,13717312,27477936,58786432,124676432,284666560,

%U 637793328,1561224832,3686729936,9636217792,23776468656,65447331712

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

%C Column 10 of A235301.

%H R. H. Hardin, <a href="/A235300/b235300.txt">Table of n, a(n) for n = 1..23</a>

%F Empirical: a(n) = 3*a(n-1) +17*a(n-2) -57*a(n-3) -86*a(n-4) +372*a(n-5) +76*a(n-6) -972*a(n-7) +360*a(n-8) +864*a(n-9) -576*a(n-10).

%e Some solutions for n=5:

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

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

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

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

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

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

%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 February 2 21:10 EST 2023. Contains 360024 sequences. (Running on oeis4.)