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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A210331 1/4 the number of (n+1)X5 0..3 arrays with every 2X2 subblock having two or three distinct clockwise edge differences 1
 43519, 10050240, 2266459861, 517186072378, 117888703860657, 26888341896724303, 6132398417786621509, 1398664622985458705816, 319003606034212278008442, 72757672377463379280503789 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 4 of A210335 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 EXAMPLE Some solutions for n=4 ..2..0..3..3..0....1..0..0..0..0....1..0..0..1..0....0..3..3..0..1 ..1..3..3..1..2....0..0..1..0..1....0..1..1..0..0....0..0..3..3..2 ..2..2..1..1..2....3..3..2..3..2....3..2..0..1..0....1..1..2..1..1 ..0..0..0..0..2....1..3..1..1..1....1..1..3..2..1....0..0..0..0..0 ..1..1..0..2..2....1..1..1..2..1....3..2..2..1..1....0..1..1..2..0 CROSSREFS Sequence in context: A126771 A103875 A224623 * A233690 A205923 A251995 Adjacent sequences:  A210328 A210329 A210330 * A210332 A210333 A210334 KEYWORD nonn AUTHOR R. H. Hardin Mar 20 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 November 28 03:29 EST 2021. Contains 349400 sequences. (Running on oeis4.)