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.

A221510 Number of 0..3 arrays of length n with each element differing from at least one neighbor by 2 or more, starting with 0.

This page as a plain text file.
%I A221510 #10 Oct 18 2017 13:27:48
%S A221510 0,2,3,12,30,89,248,706,1995,5652,15998,45297,128240,363074,1027923,
%T A221510 2910236,8239390,23327177,66043368,186980482,529374875,1498754084,
%U A221510 4243238398,12013359841,34011950560,96293859202,272624979363
%N A221510 Number of 0..3 arrays of length n with each element differing from at least one neighbor by 2 or more, starting with 0.
%C A221510 Column 3 of A221515.
%H A221510 R. H. Hardin, <a href="/A221510/b221510.txt">Table of n, a(n) for n = 1..210</a>
%F A221510 Empirical: a(n) = a(n-1) +4*a(n-2) +3*a(n-3) +a(n-4).
%F A221510 Empirical g.f.: x^2*(2 + x + x^2) / ((1 + x)*(1 - 2*x - 2*x^2 - x^3)). - _Colin Barker_, Oct 18 2017
%e A221510 Some solutions for n=6
%e A221510 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
%e A221510 ..2....2....2....2....2....3....2....2....3....3....2....3....3....2....3....3
%e A221510 ..3....0....2....1....2....0....0....3....1....3....3....2....0....1....2....3
%e A221510 ..0....2....0....3....0....3....1....1....0....1....1....0....3....3....0....1
%e A221510 ..3....2....2....0....3....0....3....1....3....3....0....3....3....3....0....0
%e A221510 ..0....0....0....3....1....2....1....3....0....0....2....0....1....1....2....3
%K A221510 nonn
%O A221510 1,2
%A A221510 _R. H. Hardin_, Jan 18 2013