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

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!)
 A206321 Number of (n+1)X3 0..3 arrays with every 2X3 or 3X2 subblock having exactly three clockwise edge increases 1
 1344, 16892, 282996, 4796092, 81302880, 1377662868, 23340152044, 395403752128, 6698395782004, 113474612575628, 1922321318016168, 32565148864444732, 551670927155642340, 9345598309321513584, 158319393789428735572 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 2 of A206327 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 24*a(n-1) -131*a(n-2) +200*a(n-3) -116*a(n-4) +35*a(n-5) -13*a(n-6) +2*a(n-7) for n>10 EXAMPLE Some solutions for n=4 ..3..0..3....3..2..3....0..3..2....3..0..0....2..2..1....2..3..3....1..0..0 ..3..1..0....1..0..1....1..0..3....2..1..2....1..0..2....0..1..0....0..2..1 ..3..2..1....0..3..0....2..1..0....3..0..3....2..1..3....3..0..3....1..0..2 ..1..0..2....1..0..3....1..0..3....2..1..2....0..2..0....2..2..0....3..1..3 ..2..1..3....3..1..0....2..1..0....3..0..3....0..3..1....0..2..1....3..2..1 CROSSREFS Sequence in context: A205820 A202430 A268907 * A230974 A239192 A172686 Adjacent sequences:  A206318 A206319 A206320 * A206322 A206323 A206324 KEYWORD nonn AUTHOR R. H. Hardin Feb 06 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.

Last modified December 2 05:01 EST 2021. Contains 349437 sequences. (Running on oeis4.)