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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A209790 Half the number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having exactly one duplicate clockwise edge difference. 1
204, 3171, 49056, 759642, 11761044, 182095128, 2819342124, 43651363500, 675845981124, 10463998747116, 162012162212700, 2508404424354996, 38837163012482148, 601308631223158716, 9309950622871199676 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 2 of A209796.

LINKS

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

FORMULA

Empirical: a(n) = 14*a(n-1) + 27*a(n-2) - 64*a(n-3) + 22*a(n-4).

Empirical g.f.: 3*x*(68 + 105*x - 282*x^2 + 99*x^3) / (1 - 14*x - 27*x^2 + 64*x^3 - 22*x^4). - Colin Barker, Jul 13 2018

EXAMPLE

Some solutions for n=4.

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

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

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

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

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

CROSSREFS

Cf. A209796.

Sequence in context: A234789 A099105 A253680 * A194192 A263505 A270605

Adjacent sequences:  A209787 A209788 A209789 * A209791 A209792 A209793

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 April 23 02:15 EDT 2019. Contains 322380 sequences. (Running on oeis4.)