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.

A221539 Number of 0..5 arrays of length n with each element differing from at least one neighbor by something other than 1, starting with 0.

This page as a plain text file.
%I A221539 #8 Oct 18 2017 18:25:10
%S A221539 0,5,22,130,716,4018,22466,125701,703193,3933916,22007609,123117952,
%T A221539 688762928,3853170001,21555920345,120591020698,674626461416,
%U A221539 3774085830607,21113497129178,118115957356066,660780130205831
%N A221539 Number of 0..5 arrays of length n with each element differing from at least one neighbor by something other than 1, starting with 0.
%C A221539 Column 5 of A221542.
%H A221539 R. H. Hardin, <a href="/A221539/b221539.txt">Table of n, a(n) for n = 1..210</a>
%F A221539 Empirical: a(n) = 5*a(n-1) +3*a(n-2) +9*a(n-4) +6*a(n-5) +3*a(n-6).
%F A221539 Empirical g.f.: x^2*(5 - 3*x + 5*x^2 + 3*x^4) / (1 - 5*x - 3*x^2 - 9*x^4 - 6*x^5 - 3*x^6). - _Colin Barker_, Oct 18 2017
%e A221539 Some solutions for n=6
%e A221539 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
%e A221539 ..3....3....4....2....3....2....2....5....3....4....5....5....0....4....4....5
%e A221539 ..5....2....5....2....3....2....3....0....5....3....1....4....2....2....2....2
%e A221539 ..3....0....0....4....2....3....5....5....5....5....1....4....3....4....0....2
%e A221539 ..0....1....3....1....4....1....2....4....3....0....2....4....1....1....4....4
%e A221539 ..5....3....1....1....4....5....4....0....1....0....4....1....5....4....0....1
%K A221539 nonn
%O A221539 1,2
%A A221539 _R. H. Hardin_, Jan 19 2013