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!)
A234457 Number of (n+1) X (6+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings). 0
16026240, 1246417268, 108833647220, 10112283614188, 968883628673536, 94562060782336540, 9313238635318242880, 923173430231908792924, 91746122270765342416988 (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=1:

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

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

CROSSREFS

Column 6 of A234458.

Sequence in context: A058909 A179585 A105650 * A204604 A253716 A216004

Adjacent sequences: A234454 A234455 A234456 * A234458 A234459 A234460

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 November 30 18:54 EST 2022. Contains 358453 sequences. (Running on oeis4.)