cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A232592 Number of (3+1)X(n+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or antidiagonally, with no adjacent elements equal.

Original entry on oeis.org

4, 124, 42, 996, 606, 8104, 7568, 66744, 82132, 556612, 836046, 4691760, 8187072, 39925804, 78178630, 342580066, 733698936, 2960354254, 6801151306, 25734466516, 62477896160, 224824244852, 570101087316, 1972190659984, 5175766221764
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2013

Keywords

Comments

Row 3 of A232589

Examples

			Some solutions for n=7
..2..1..0..1..2..1..0..1....0..1..2..1..0..2..1..0....0..1..2..0..1..2..1..0
..0..1..2..1..2..1..2..1....2..1..0..2..1..0..1..2....0..1..2..0..1..2..1..0
..2..1..0..1..2..1..0..2....2..1..0..2..1..0..1..0....2..0..1..0..1..0..1..0
..2..1..2..1..0..2..1..0....0..2..1..0..1..2..1..2....1..2..1..0..1..2..1..0
		

Formula

Empirical: a(n) = 10*a(n-2) +8*a(n-3) -16*a(n-4) -56*a(n-5) -27*a(n-6) +64*a(n-7) +154*a(n-8) +50*a(n-9) -123*a(n-10) -248*a(n-11) -60*a(n-12) +168*a(n-13) +246*a(n-14) +40*a(n-15) -138*a(n-16) -128*a(n-17) -27*a(n-18) +40*a(n-19) +30*a(n-20) +14*a(n-21) +a(n-22) -a(n-24) for n>26