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!)
A234327 Number of (n+1) X (2+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings). 1
432, 3296, 25728, 203008, 1603680, 12713312, 100679584, 799588512, 6341424800, 50436411040, 400533940512, 3190038587424, 25365477524640, 202291348481184, 1610482677443104, 12860140933119776, 102502504089127840 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

FORMULA

Empirical: a(n) = 10*a(n-1) +59*a(n-2) -768*a(n-3) +608*a(n-4) +7580*a(n-5) -11628*a(n-6) -18088*a(n-7) +32880*a(n-8) +3232*a(n-9) -17600*a(n-10) +4224*a(n-11).

EXAMPLE

Some solutions for n=3:

  3 2 2   0 0 1   3 2 1   1 1 0   2 2 3   1 3 2   2 2 0

  0 0 1   1 2 2   1 1 1   2 3 3   0 1 1   1 2 0   2 1 0

  2 3 3   2 2 3   2 1 0   2 2 3   0 2 1   2 2 1   3 3 3

  0 0 1   0 1 1   3 3 1   3 2 2   0 3 3   3 2 2   2 3 2

CROSSREFS

Column 2 of A234333.

Sequence in context: A006910 A015229 A248460 * A174717 A235418 A235422

Adjacent sequences:  A234324 A234325 A234326 * A234328 A234329 A234330

KEYWORD

nonn

AUTHOR

R. H. Hardin, Dec 23 2013

STATUS

approved

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 August 12 06:02 EDT 2022. Contains 356067 sequences. (Running on oeis4.)