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!)
A238079 Number of (n+1)X(6+1) 0..3 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1
2285576, 92535056, 2981477664, 119781203860, 5032066269920, 220851136586828, 10041551776656136, 456549432890203120, 20035129498369668404, 893747303790414545880, 40943165064239830411928, 1868103335028328725648336 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 6 of A238081

LINKS

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

EXAMPLE

Some solutions for n=1

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

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

CROSSREFS

Sequence in context: A204603 A176382 A092017 * A209958 A324637 A186587

Adjacent sequences:  A238076 A238077 A238078 * A238080 A238081 A238082

KEYWORD

nonn

AUTHOR

R. H. Hardin, Feb 17 2014

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 May 29 08:07 EDT 2020. Contains 334697 sequences. (Running on oeis4.)