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

%I #6 Jun 20 2022 19:10:44

%S 944,3540,13260,49784,187196,705072,2659824,10049936,38030588,

%T 144134184,547062036,2079436784,7915312712,30172181304,115169444940,

%U 440212045280,1684837886252,6456944580816,24776948509056,95196417683360

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

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

%F Empirical: a(n) = 13*a(n-1) -43*a(n-2) -107*a(n-3) +865*a(n-4) -1033*a(n-5) -1916*a(n-6) +2822*a(n-7) +2712*a(n-8) -1332*a(n-9) -1512*a(n-10) -288*a(n-11).

%e Some solutions for n=5:

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

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

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

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

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

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

%Y Column 3 of A234490.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 26 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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)