A209788 - OEIS

A209788

Half the number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference

30, 3171, 1732554, 4953638163, 73890766377408, 5755153225046584062, 2340066952652845862645106, 4967430727164307775296528613529, 55050195060396467478193037853217885236

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Diagonal of A209796

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

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

CROSSREFS

Sequence in context: A352182 A001459 A303007 * A265855 A289395 A338962

Adjacent sequences: A209785 A209786 A209787 * A209789 A209790 A209791

KEYWORD

nonn

AUTHOR

R. H. Hardin Mar 13 2012

STATUS

approved