login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A209779 Half the number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference 0
64, 12492, 13606964, 89046135210, 3413352967754696, 774627496109684203370, 1034141529418861531701953000, 8145663030420623706384712975053986 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Diagonal of A209787

LINKS

Table of n, a(n) for n=1..8.

EXAMPLE

Some solutions for n=4

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

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

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

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

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

CROSSREFS

Sequence in context: A268055 A268078 A202548 * A220300 A316485 A292025

Adjacent sequences:  A209776 A209777 A209778 * A209780 A209781 A209782

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 11:28 EST 2021. Contains 349557 sequences. (Running on oeis4.)