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!)
A209784 Half the number of (n+1)X6 0..3 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference 1
397734, 122871278, 36572974507, 11197401806412, 3413352967754696, 1043428174053823487, 318751987571164698772, 97407366419231553054246, 29763727089493837413742773, 9094996467359607511188778436 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 5 of A209787

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

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

CROSSREFS

Sequence in context: A234331 A250925 A230148 * A015424 A083634 A209910

Adjacent sequences:  A209781 A209782 A209783 * A209785 A209786 A209787

KEYWORD

nonn

AUTHOR

R. H. Hardin Mar 13 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 30 19:43 EDT 2022. Contains 354945 sequences. (Running on oeis4.)