login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184229 Half the number of (n+1)X8 0..3 arrays with every 2X2 subblock diagonal sum differing from its antidiagonal sum by more than 3 1
23355, 3302001, 231988508, 22718557269, 1922921988456, 174220807520698, 15315046904131217, 1365148390837029545, 120929646236147243376, 10742955468995988996920, 953140018069343327537272 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 7 of A184231

LINKS

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

EXAMPLE

Some solutions for 3X8

..0..2..0..1..0..2..0..3....0..2..0..2..0..2..1..3....0..2..0..2..0..3..0..1

..3..0..3..0..3..0..3..2....2..0..3..0..3..0..3..0....2..0..3..0..2..0..3..0

..1..2..0..3..0..1..0..3....1..3..2..3..1..2..1..2....0..2..0..3..0..3..1..3

CROSSREFS

Sequence in context: A133968 A251111 A205834 * A153771 A252944 A246891

Adjacent sequences:  A184226 A184227 A184228 * A184230 A184231 A184232

KEYWORD

nonn

AUTHOR

R. H. Hardin Jan 10 2011

STATUS

approved

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 January 27 15:14 EST 2020. Contains 331295 sequences. (Running on oeis4.)