login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A234454 Number of (n+1)X(3+1) 0..5 arrays with every 2X2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant stress 1X1 tilings) 1

%I

%S 21344,427956,9249432,207310120,4726887280,108833647220,2516987045248,

%T 58398272232836,1356332197407768,31546244050128332,733745025666040408,

%U 17081749645650678160,397559951529941797856,9259739427069345664228

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

%C Column 3 of A234458

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

%e Some solutions for n=1

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

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

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 11 15:41 EST 2019. Contains 329017 sequences. (Running on oeis4.)