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.
%I A232590 #8 Jul 23 2025 07:31:19 %S A232590 0,10,2,26,20,70,90,210,336,674,1178,2234,4036,7502,13714,25314,46464, %T A232590 85562,157266,289370,532116,978838,1800234,3311282,6090256,11201874, %U A232590 20603306,37895546,69700612,128199582,235795618,433695938,797691008 %N A232590 Number of (1+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. %C A232590 Row 1 of A232589 %H A232590 R. H. Hardin, <a href="/A232590/b232590.txt">Table of n, a(n) for n = 1..210</a> %F A232590 Empirical: a(n) = -a(n-1) +2*a(n-2) +4*a(n-3) +3*a(n-4) +a(n-5). %F A232590 Empirical: G.f.: -2*x^2*(5+6*x+4*x^2+x^3) / ( (x^3+x^2+x-1)*(1+x)^2 ). - _R. J. Mathar_, Nov 23 2014 %e A232590 Some solutions for n=7 %e A232590 ..0..1..2..1..0..1..2..0....0..1..2..1..2..1..0..2....0..1..2..1..2..0..1..2 %e A232590 ..2..1..0..1..2..0..1..2....0..1..0..1..0..2..1..0....2..1..0..1..2..0..1..0 %K A232590 nonn %O A232590 1,2 %A A232590 _R. H. Hardin_, Nov 26 2013