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!)
A210299 Half the number of (n+1)X8 0..3 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference 1
872455004, 24016699289368, 658686645074030420, 18074362569780907584746, 495927352523356139887864420, 13607462253433812638431489199962, 373366766716480043025684339650029800 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 7 of A210300

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

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

CROSSREFS

Sequence in context: A214557 A214558 A183708 * A178557 A157798 A328135

Adjacent sequences:  A210296 A210297 A210298 * A210300 A210301 A210302

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 March 29 05:39 EDT 2020. Contains 333105 sequences. (Running on oeis4.)