This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A209532 Half the number of (n+1)X7 0..2 arrays with every 2X2 subblock having exactly two distinct clockwise edge differences 1
 129, 1537, 16385, 196609, 2097153, 25165825, 268435457, 3221225473, 34359738369, 412316860417, 4398046511105, 52776558133249, 562949953421313, 6755399441055745, 72057594037927937, 864691128455135233 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 6 of A209534 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = a(n-1) +128*a(n-2) -128*a(n-3) EXAMPLE Some solutions for n=4 ..0..1..2..1..2..1..2....0..1..2..1..2..1..0....1..2..1..2..1..2..1 ..1..2..1..2..1..2..1....1..0..1..0..1..0..1....2..1..0..1..2..1..2 ..0..1..0..1..0..1..0....2..1..2..1..0..1..2....1..2..1..0..1..2..1 ..1..2..1..2..1..2..1....1..0..1..2..1..0..1....0..1..2..1..2..1..0 ..2..1..2..1..0..1..2....0..1..0..1..2..1..0....1..0..1..0..1..2..1 CROSSREFS Sequence in context: A043383 A036548 A046286 * A088719 A034681 A017677 Adjacent sequences:  A209529 A209530 A209531 * A209533 A209534 A209535 KEYWORD nonn AUTHOR R. H. Hardin Mar 10 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .