login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A234669 Number of (n+1) X (3+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). 1
29568, 217968, 1604020, 11826092, 87273500, 644848264, 4769561472, 35319420856, 261811840168, 1942988877232, 14433959951680, 107349012026192, 799169229326556, 5956201429623128, 44434739229424040, 331862990142839740 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

Some solutions for n=1:

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

  3 3 3 1     6 0 2 0     2 2 5 1     6 5 2 5     7 3 6 1

CROSSREFS

Column 3 of A234672.

Sequence in context: A232201 A251563 A022200 * A031656 A236734 A236317

Adjacent sequences:  A234666 A234667 A234668 * A234670 A234671 A234672

KEYWORD

nonn

AUTHOR

R. H. Hardin, Dec 29 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 November 26 11:14 EST 2022. Contains 358359 sequences. (Running on oeis4.)