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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A209905 Half the number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences 0
 62, 13098, 16664508, 135833193008, 6954596004028468, 2253166071062026531552, 4605826850905941430535864352, 59470527831535893681344131012059952 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Diagonal of A209913 LINKS EXAMPLE Some solutions for n=4 ..0..2..2..1..0....3..0..3..3..0....1..0..0..0..0....3..0..0..1..1 ..3..3..0..2..3....0..3..0..1..3....3..1..3..1..3....1..3..1..3..0 ..0..1..3..3..2....1..0..1..0..1....1..3..1..3..0....0..0..3..1..1 ..3..1..0..1..3....1..3..3..2..3....1..0..3..0..1....3..1..0..0..3 ..3..0..1..3..1....2..1..0..0..3....0..1..1..0..3....0..3..3..2..2 CROSSREFS Sequence in context: A123806 A233340 A299826 * A227357 A093262 A159374 Adjacent sequences:  A209902 A209903 A209904 * A209906 A209907 A209908 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 29 07:13 EDT 2022. Contains 354122 sequences. (Running on oeis4.)