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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A210268 Half the number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having two or three distinct clockwise edge differences 1
35, 5558, 6028871, 44678808183, 2261599192647037, 781910030615896210474, 1846356382998737252290206762, 29777644269614247388351983235258241, 3280051134759806457403130482690269897360711 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Diagonal of A210276

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

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

CROSSREFS

Sequence in context: A202067 A336306 A202881 * A025036 A224126 A249888

Adjacent sequences:  A210265 A210266 A210267 * A210269 A210270 A210271

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 October 18 19:31 EDT 2021. Contains 348069 sequences. (Running on oeis4.)