login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A209943 Half the number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference 1
34, 4975, 4681176, 28414622976, 1111386232102422, 280228918282467201434, 455417252425855582254656088, 4770739366042378532001509022194668, 322127888969925272433863054772450693097784 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Diagonal of A209951

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

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

CROSSREFS

Sequence in context: A129056 A212034 A232900 * A187708 A231084 A212035

Adjacent sequences:  A209940 A209941 A209942 * A209944 A209945 A209946

KEYWORD

nonn

AUTHOR

R. H. Hardin Mar 16 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified July 22 17:39 EDT 2014. Contains 244836 sequences.