The OEIS is supported by the many generous donors to the OEIS 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206079 Number of (n+1)X3 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one 1
 960, 13672, 187144, 2567488, 35195768, 482548752, 6615795040, 90703800392, 1243565136120, 17049501235304, 233751713986960, 3204777864965096, 43938078463070080, 602398924621561376, 8258997140090964632 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 2 of A206085 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 15*a(n-1) -14*a(n-2) -61*a(n-3) +154*a(n-4) -152*a(n-5) +198*a(n-6) -166*a(n-7) +64*a(n-8) -28*a(n-9) +8*a(n-10) EXAMPLE Some solutions for n=4 ..3..2..2....2..3..1....2..1..3....1..3..0....3..0..1....2..0..1....0..0..1 ..1..1..2....3..3..3....2..2..2....1..3..0....3..0..1....2..0..0....3..0..0 ..2..1..1....1..1..3....2..3..2....1..3..0....3..0..1....2..2..2....0..0..1 ..1..1..2....2..1..1....2..3..1....3..3..3....3..0..0....0..2..3....2..0..0 ..0..1..1....3..3..1....2..3..3....3..2..2....3..3..3....1..2..2....2..2..0 CROSSREFS Sequence in context: A330496 A057666 A046788 * A203732 A157851 A278011 Adjacent sequences: A206076 A206077 A206078 * A206080 A206081 A206082 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 26 21:15 EST 2022. Contains 358362 sequences. (Running on oeis4.)