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.

A221454 Number of 0..3 arrays of length n with each element unequal to at least one neighbor, with new values introduced in 0..3 order.

This page as a plain text file.
%I A221454 #7 Mar 14 2018 11:05:51
%S A221454 0,1,2,7,24,88,328,1235,4668,17675,66974,253858,962352,3648397,
%T A221454 13831870,52440191,198815196,753764564,2857736696,10834499599,
%U A221454 41076702120,155733594211,590430871282,2238493367822,8486772670944,32175798041273
%N A221454 Number of 0..3 arrays of length n with each element unequal to at least one neighbor, with new values introduced in 0..3 order.
%C A221454 Column 3 of A221459.
%H A221454 R. H. Hardin, <a href="/A221454/b221454.txt">Table of n, a(n) for n = 1..210</a>
%F A221454 Empirical: a(n) = 4*a(n-1) + a(n-2) - 6*a(n-3) - 3*a(n-4).
%F A221454 Empirical g.f.: x^2*(1 - 2*x - 2*x^2) / ((1 - x - x^2)*(1 - 3*x - 3*x^2)). - _Colin Barker_, Mar 14 2018
%e A221454 Some solutions for n=6:
%e A221454 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
%e A221454 ..1....1....1....1....1....1....1....1....1....1....1....1....1....1....1....1
%e A221454 ..1....2....2....1....0....2....2....2....1....2....2....2....2....2....2....2
%e A221454 ..0....2....3....2....1....0....1....3....2....1....1....1....3....2....3....0
%e A221454 ..0....1....2....2....2....1....3....3....1....2....2....0....3....0....1....0
%e A221454 ..1....3....1....0....0....3....1....2....2....3....0....3....1....3....2....1
%Y A221454 Cf. A221459.
%K A221454 nonn
%O A221454 1,3
%A A221454 _R. H. Hardin_, Jan 17 2013