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.

A230185 Number of 2 X n 0..2 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value 2-x(i,j).

This page as a plain text file.
%I A230185 #8 Sep 21 2018 14:57:43
%S A230185 0,9,27,159,825,4395,23307,123729,656715,3485775,18502017,98206299,
%T A230185 521266155,2766812505,14685878427,77950719519,413752211145,
%U A230185 2196142553835,11656837079787,61872964697889,328413594039435,1743176349744015
%N A230185 Number of 2 X n 0..2 arrays x(i,j) with each element horizontally or antidiagonally next to at least one element with value 2-x(i,j).
%H A230185 R. H. Hardin, <a href="/A230185/b230185.txt">Table of n, a(n) for n = 1..210</a>
%F A230185 Empirical: a(n) = 4*a(n-1) + 7*a(n-2) + a(n-3) - 6*a(n-4) - 5*a(n-5) for n>6.
%F A230185 Empirical g.f.: 3*x^2*(3 - 3*x - 4*x^2 - 3*x^3 + 3*x^4) / ((1 - x)*(1 + x)*(1 - 4*x - 6*x^2 - 5*x^3)). - _Colin Barker_, Sep 21 2018
%e A230185 Some solutions for n=3:
%e A230185 ..2..0..2....0..2..0....1..1..2....1..1..2....0..2..1....1..1..1....0..2..2
%e A230185 ..2..0..2....0..1..1....1..0..2....2..0..2....0..1..1....1..0..2....2..0..2
%Y A230185 Row 2 of A230184.
%K A230185 nonn
%O A230185 1,2
%A A230185 _R. H. Hardin_, Oct 11 2013