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.

A221540 Number of 0..6 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 A221540 #8 Oct 18 2017 18:23:16
%S A221540 0,6,32,222,1455,9665,64047,424593,2814515,18656979,123673887,
%T A221540 819813575,5434406883,36023773275,238795558499,1582935756291,
%U A221540 10493015970771,69556445196155,461078023878243,3056408985571563,20260423189286435
%N A221540 Number of 0..6 arrays of length n with each element differing from at least one neighbor by something other than 1, starting with 0.
%C A221540 Column 6 of A221542.
%H A221540 R. H. Hardin, <a href="/A221540/b221540.txt">Table of n, a(n) for n = 1..210</a>
%F A221540 Empirical: a(n) = 7*a(n-1) -4*a(n-2) +6*a(n-3) +26*a(n-4) +10*a(n-5) +16*a(n-6) +12*a(n-8).
%F A221540 Empirical g.f.: x^2*(6 - 10*x + 22*x^2 - 7*x^3 + 20*x^4 - 12*x^5 + 6*x^6) / (1 - 7*x + 4*x^2 - 6*x^3 - 26*x^4 - 10*x^5 - 16*x^6 - 12*x^8). - _Colin Barker_, Oct 18 2017
%e A221540 Some solutions for n=6
%e A221540 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
%e A221540 ..6....5....2....4....5....2....0....0....5....6....3....0....2....0....5....4
%e A221540 ..2....2....6....1....2....1....0....6....6....6....5....6....0....4....1....0
%e A221540 ..5....2....0....6....2....1....2....2....6....3....1....3....3....3....0....6
%e A221540 ..5....6....0....5....6....5....6....0....6....4....5....5....4....1....3....6
%e A221540 ..2....6....0....3....0....0....4....4....0....1....3....1....0....6....3....4
%K A221540 nonn
%O A221540 1,2
%A A221540 _R. H. Hardin_, Jan 19 2013