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!)
A206048 Number of (n+1) X 3 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to one. 1
255, 2310, 20400, 180195, 1590378, 14037225, 123893883, 1093502865, 9651382368, 85184227872, 751845910863, 6635879577384, 58569045932253, 516937220242281, 4562548107080751, 40269580936702038, 355424011046747292 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 2 of A206054.

LINKS

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

FORMULA

Empirical: a(n) = 9*a(n-1) + a(n-2) - 24*a(n-3) + 15*a(n-4) - 6*a(n-5) + 4*a(n-6).

Empirical g.f.: 3*x*(85 + 5*x - 215*x^2 + 135*x^3 - 54*x^4 + 36*x^5) / (1 - 9*x - x^2 + 24*x^3 - 15*x^4 + 6*x^5 - 4*x^6). - Colin Barker, Jun 13 2018

EXAMPLE

Some solutions for n=4:

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

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

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

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

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

CROSSREFS

Cf. A206054.

Sequence in context: A236792 A259247 A204738 * A160908 A038995 A068024

Adjacent sequences:  A206045 A206046 A206047 * A206049 A206050 A206051

KEYWORD

nonn

AUTHOR

R. H. Hardin, Feb 03 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 19 14:56 EDT 2021. Contains 348090 sequences. (Running on oeis4.)