The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS 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 2 X 2 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
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
Cf. A238081.
Sequence in context: A347937 A339937 A092017 * A209958 A324637 A186587
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 12 10:07 EDT 2024. Contains 373329 sequences. (Running on oeis4.)