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!)
A234493 Number of (n+1) X (3+1) 0..5 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
13464, 158288, 1856768, 22124316, 260915944, 3122368992, 36940569778, 443886085700, 5267872223782, 63565110955752, 756696012118752, 9169781418833544, 109495524770067884, 1332679274592188150 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

Some solutions for n=2:

1 4 0 4 4 3 4 4 0 0 5 3 4 3 2 3 0 2 2 2

3 4 2 4 2 3 2 4 0 2 5 5 0 1 2 1 5 5 3 5

2 5 1 5 1 4 1 5 2 2 3 1 4 3 2 3 4 2 2 2

CROSSREFS

Column 3 of A234497.

Sequence in context: A284952 A250616 A115925 * A029557 A115922 A248444

Adjacent sequences: A234490 A234491 A234492 * A234494 A234495 A234496

KEYWORD

nonn

AUTHOR

R. H. Hardin, Dec 26 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 March 30 16:23 EDT 2023. Contains 361622 sequences. (Running on oeis4.)