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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A252688 Number of (n+2)X(1+2) 0..3 arrays with every consecutive three elements in every row and column having exactly two distinct values, and in every diagonal and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order 1
 46, 96, 148, 394, 707, 1982, 3703, 10772, 20437, 60042, 115343, 338174, 656519, 1913418, 3749109, 10848316, 21436803, 61563668, 122626571, 349539732, 701532497, 1985146994, 4013145959, 11276488886, 22954622815, 64065149914 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 1 of A252695 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 2*a(n-1) +9*a(n-2) -15*a(n-3) -30*a(n-4) +21*a(n-5) +80*a(n-6) +18*a(n-7) -132*a(n-8) -76*a(n-9) +88*a(n-10) +108*a(n-11) -32*a(n-12) -40*a(n-13) for n>14 EXAMPLE Some solutions for n=4 ..0..1..0....0..1..0....0..1..0....0..1..1....0..1..1....0..1..0....0..0..1 ..2..1..2....2..3..2....2..1..2....2..3..2....2..3..2....2..1..2....2..0..0 ..2..3..2....2..1..2....2..0..2....2..3..2....2..1..2....2..3..2....2..2..0 ..0..1..0....0..3..0....1..0..1....0..2..0....0..3..0....1..3..1....3..2..2 ..0..1..0....0..3..0....1..2..1....2..3..2....0..3..0....1..0..1....3..3..2 ..2..2..3....1..2..2....3..0..3....2..3..2....2..1..2....3..3..2....1..3..3 CROSSREFS Sequence in context: A044184 A044565 A252695 * A358897 A119417 A287767 Adjacent sequences: A252685 A252686 A252687 * A252689 A252690 A252691 KEYWORD nonn AUTHOR R. H. Hardin, Dec 20 2014 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 June 20 13:37 EDT 2024. Contains 373527 sequences. (Running on oeis4.)