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!)
 A234784 Number of (n+1)X(6+1) 0..3 arrays with no adjacent elements equal and with each 2X2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases 1
 797988, 241927524, 75353928188, 23692759265012, 7476894104333052, 2363085244017636364, 747324517604795047044, 236402993427571147646860, 74790182365485126434100804, 23662267614587185373925151684 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 6 of A234786 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 EXAMPLE Some solutions for n=1 ..3..0..1..2..1..2..3....3..0..2..3..1..3..2....3..0..2..1..2..0..1 ..0..2..3..0..2..0..2....0..1..3..0..2..1..3....0..2..1..2..3..2..0 CROSSREFS Sequence in context: A259304 A151561 A022203 * A206135 A237543 A053086 Adjacent sequences: A234781 A234782 A234783 * A234785 A234786 A234787 KEYWORD nonn AUTHOR R. H. Hardin, Dec 30 2013 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 December 8 22:05 EST 2022. Contains 358698 sequences. (Running on oeis4.)