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

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A234482 Number of (n+1) X (n+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). 0
 62, 926, 13260, 183422, 2455350, 31925284, 404043442, 4993740182, 60359720132 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..9. EXAMPLE Some solutions for n=4: 2 1 2 2 3 0 3 3 0 3 0 3 3 3 1 2 3 3 0 2 2 3 2 0 3 2 3 1 0 1 0 1 3 1 1 1 0 2 1 1 1 0 1 1 2 1 0 0 1 0 2 1 1 1 3 1 2 2 3 1 2 3 2 0 3 2 3 1 0 1 0 1 3 1 1 0 3 1 0 0 2 1 2 2 3 1 0 0 1 0 1 0 0 0 2 0 1 1 2 0 CROSSREFS Diagonal of A234490. Sequence in context: A196413 A131473 A138408 * A157499 A249235 A250564 Adjacent sequences: A234479 A234480 A234481 * A234483 A234484 A234485 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.

Last modified December 5 13:14 EST 2023. Contains 367591 sequences. (Running on oeis4.)