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!)
A210298 Half the number of (n+1)X7 0..3 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference 1
61973516, 482519042626, 3744799069935140, 29075895528477825602, 225741948376039857049980, 1752648993312488853687634462, 13607462253433812638431489199962, 105647542211301539024933439827978282 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 6 of A210300

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

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

CROSSREFS

Sequence in context: A059001 A059003 A104931 * A204883 A096559 A203943

Adjacent sequences:  A210295 A210296 A210297 * A210299 A210300 A210301

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 April 7 10:46 EDT 2020. Contains 333301 sequences. (Running on oeis4.)