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.

A269601 Number of length-n 0..2 arrays with no repeated value differing from the previous repeated value by one or less.

This page as a plain text file.
%I A269601 #9 Jan 24 2019 17:07:33
%S A269601 3,9,24,62,154,376,902,2142,5040,11786,27418,63544,146822,338478,
%T A269601 778944,1790282,4110730,9432424,21633542,49603134,113717328,260691722,
%U A269601 597649402,1370287384,3142264070,7206988878,16533117792,37935980618,87065571946
%N A269601 Number of length-n 0..2 arrays with no repeated value differing from the previous repeated value by one or less.
%H A269601 R. H. Hardin, <a href="/A269601/b269601.txt">Table of n, a(n) for n = 1..210</a>
%F A269601 Empirical: a(n) = 5*a(n-1) - 5*a(n-2) - 8*a(n-3) + 12*a(n-4).
%F A269601 Empirical g.f.: x*(3 - 6*x - 6*x^2 + 11*x^3) / ((1 - 2*x)^2*(1 - x - 3*x^2)). - _Colin Barker_, Jan 24 2019
%e A269601 Some solutions for n=7:
%e A269601 ..2. .2. .2. .2. .2. .0. .1. .0. .2. .2. .2. .1. .0. .1. .2. .2
%e A269601 ..1. .1. .1. .1. .0. .2. .2. .2. .0. .0. .1. .2. .2. .2. .0. .1
%e A269601 ..2. .1. .0. .2. .2. .1. .1. .2. .0. .1. .0. .2. .1. .1. .1. .0
%e A269601 ..0. .2. .2. .1. .1. .0. .1. .1. .2. .1. .1. .0. .0. .0. .0. .1
%e A269601 ..1. .1. .0. .0. .0. .2. .2. .0. .0. .0. .0. .1. .2. .1. .1. .2
%e A269601 ..1. .0. .1. .2. .2. .0. .0. .2. .1. .1. .0. .2. .1. .0. .0. .1
%e A269601 ..2. .1. .0. .0. .1. .0. .1. .0. .2. .2. .2. .0. .1. .2. .1. .0
%Y A269601 Column 2 of A269606.
%K A269601 nonn
%O A269601 1,1
%A A269601 _R. H. Hardin_, Mar 01 2016