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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A209909 Half the number of (n+1)X5 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences 1
 44770, 6711168, 948609890, 135833193008, 19391662870652, 2771380588485262, 395928291655518846, 56572313966664992566, 8082834582799800606818, 1154877996377518700415076, 165007101830680869540237766 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 4 of A209913 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 EXAMPLE Some solutions for n=4 ..1..1..3..3..0....3..0..0..1..1....0..2..2..1..0....1..0..0..0..0 ..3..0..1..0..2....1..3..1..3..0....3..3..0..2..3....3..1..3..1..3 ..1..1..2..1..3....0..0..3..1..1....0..1..3..3..2....1..3..1..3..0 ..3..0..1..0..2....3..1..0..0..3....3..1..0..1..3....1..0..3..0..1 ..1..3..2..1..3....0..3..3..2..2....3..0..1..3..1....0..1..1..0..3 CROSSREFS Sequence in context: A248066 A252147 A225814 * A251790 A197421 A197614 Adjacent sequences:  A209906 A209907 A209908 * A209910 A209911 A209912 KEYWORD nonn AUTHOR R. H. Hardin Mar 15 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 22 21:15 EST 2022. Contains 350504 sequences. (Running on oeis4.)