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!)
A210297 Half the number of (n+1)X6 0..3 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference 1
4402192, 9694276684, 21290108702694, 46773822117508382, 102755730987812117952, 225741948376039857049980, 495927352523356139887864420, 1089491673865425887607249889930 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 5 of A210300

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

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

CROSSREFS

Sequence in context: A237537 A276323 A288086 * A019288 A237910 A244575

Adjacent sequences:  A210294 A210295 A210296 * A210298 A210299 A210300

KEYWORD

nonn

AUTHOR

R. H. Hardin Mar 19 2012

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 31 09:30 EDT 2020. Contains 334748 sequences. (Running on oeis4.)