The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206149 Number of (n+1) X 8 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases. 1
 13122, 485778, 18451530, 707982258, 27284864220, 1053631126386, 40724629633188, 1574756199257154, 60905630834498448, 2355823979126396484, 91127113576629203340, 3525019283291091200178, 136357697258861377287582 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 7 of A206150. LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 105*a(n-1) -4473*a(n-2) +105654*a(n-3) -1580037*a(n-4) +16082595*a(n-5) -116408090*a(n-6) +616031475*a(n-7) -2425718097*a(n-8) +7181467374*a(n-9) -16063429749*a(n-10) +27150592284*a(n-11) -34525830041*a(n-12) +32730104655*a(n-13) -22785383754*a(n-14) +11380763892*a(n-15) -3932260752*a(n-16) +884206944*a(n-17) -115250048*a(n-18) +6527616*a(n-19). EXAMPLE Some solutions for n=4: ..2..1..0..1..2..1..0..1....0..1..0..1..2..1..0..1....1..2..1..0..2..1..2..1 ..1..2..1..0..1..0..1..0....1..0..1..0..1..2..1..2....2..1..0..1..0..2..0..2 ..2..0..2..1..2..1..2..1....2..1..2..1..2..1..2..1....1..2..1..2..1..0..2..0 ..0..2..0..2..0..2..1..2....1..0..1..2..1..0..1..2....2..0..2..1..2..1..0..1 ..1..0..2..0..1..0..2..1....0..2..0..1..0..1..2..1....0..2..0..2..0..2..1..2 CROSSREFS Sequence in context: A157433 A089212 A023320 * A221156 A068760 A252156 Adjacent sequences:  A206146 A206147 A206148 * A206150 A206151 A206152 KEYWORD nonn AUTHOR R. H. Hardin, Feb 04 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 January 19 09:16 EST 2022. Contains 350464 sequences. (Running on oeis4.)