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!)
A184212 Number of (n+1)X5 0..3 arrays with every 2X2 subblock sum greater than 6 1
85600, 22249026, 4411909035, 977644225220, 208292231201647, 45067897172765323, 9695194773105361105, 2090316835956005082252, 450298899065135536168802, 97035410726195213179750677 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 4 of A184217

LINKS

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

EXAMPLE

Some solutions for 3X5

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

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

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

CROSSREFS

Sequence in context: A195468 A200657 A201269 * A253531 A179575 A234805

Adjacent sequences: A184209 A184210 A184211 * A184213 A184214 A184215

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 21:57 EST 2022. Contains 358453 sequences. (Running on oeis4.)