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!)
A210296 Half the number of (n+1)X5 0..3 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference 1
312704, 194768054, 121040117840, 75244563204398, 46773822117508382, 29075895528477825602, 18074362569780907584746, 11235513600375237582792174, 6984299629532890008981374274, 4341629868067826124129752698278 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 4 of A210300

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

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

CROSSREFS

Sequence in context: A224631 A180461 A250371 * A214244 A102499 A234121

Adjacent sequences:  A210293 A210294 A210295 * A210297 A210298 A210299

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 30 15:13 EDT 2020. Contains 334726 sequences. (Running on oeis4.)