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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A209954 Number of (n+1)X3 0..2 arrays with every 2X2 subblock having one, three or four distinct clockwise edge differences 1
 567, 12161, 260201, 5569307, 119198607, 2551206049, 54603359537, 1168673933963, 25013090104279, 535354363340225, 11458172261417433, 245238893701357211, 5248840184974455807, 112340758338207683457, 2404425652140227799457 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 2 of A209960 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 24*a(n-1) -23*a(n-2) -678*a(n-3) -472*a(n-4) +1196*a(n-5) +448*a(n-6) -416*a(n-7) EXAMPLE Some solutions for n=4 ..1..1..2....2..0..1....1..2..1....1..2..0....2..2..2....0..0..2....2..0..1 ..1..1..2....2..0..2....1..1..1....1..2..1....1..1..0....0..0..0....0..0..0 ..1..1..1....1..0..2....1..0..1....2..2..0....2..2..0....0..1..1....2..2..1 ..0..1..2....1..2..1....2..2..2....0..0..0....1..0..1....0..0..1....2..0..0 ..2..1..2....2..2..1....0..1..2....2..0..0....2..0..2....0..2..2....2..0..0 CROSSREFS Sequence in context: A051372 A252599 A023099 * A233057 A087424 A134922 Adjacent sequences: A209951 A209952 A209953 * A209955 A209956 A209957 KEYWORD nonn AUTHOR R. H. Hardin Mar 16 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 December 4 05:09 EST 2023. Contains 367541 sequences. (Running on oeis4.)