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!)
A210292 Half the number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference 0
112, 78628, 688122928, 75244563204398, 102755730987812117952, 1752648993312488853687634462, 373366766716480043025684339650029800, 993411552731407131616878668696108769698390398 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Diagonal of A210300

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

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

CROSSREFS

Sequence in context: A051366 A051363 A304394 * A270146 A184898 A270113

Adjacent sequences:  A210289 A210290 A210291 * A210293 A210294 A210295

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 December 5 15:06 EST 2021. Contains 349557 sequences. (Running on oeis4.)