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.

A269616 Number of length-n 0..5 arrays with no repeated value differing from the previous repeated value by other than plus two, zero or minus 1.

This page as a plain text file.
%I A269616 #4 Mar 01 2016 14:55:07
%S A269616 6,36,216,1275,7440,43013,246798,1407232,7982022,45074673,253574688,
%T A269616 1421878274,7950451524,44345786735,246818403470,1371136321437,
%U A269616 7604288654552,42110933628975,232895831580810,1286536158378699
%N A269616 Number of length-n 0..5 arrays with no repeated value differing from the previous repeated value by other than plus two, zero or minus 1.
%C A269616 Column 5 of A269619.
%H A269616 R. H. Hardin, <a href="/A269616/b269616.txt">Table of n, a(n) for n = 1..210</a>
%F A269616 Empirical: a(n) = 35*a(n-1) -519*a(n-2) +4195*a(n-3) -19640*a(n-4) +51000*a(n-5) -56851*a(n-6) -16105*a(n-7) +50448*a(n-8) +35280*a(n-9) +12993*a(n-10) +3195*a(n-11) +444*a(n-12) +30*a(n-13)
%e A269616 Some solutions for n=6
%e A269616 ..2. .1. .5. .1. .2. .5. .3. .4. .0. .5. .3. .2. .0. .5. .1. .4
%e A269616 ..5. .4. .3. .4. .0. .3. .4. .2. .5. .2. .1. .3. .2. .3. .2. .0
%e A269616 ..5. .3. .3. .2. .1. .0. .3. .5. .5. .5. .4. .3. .2. .3. .0. .3
%e A269616 ..4. .3. .2. .3. .5. .3. .5. .0. .4. .3. .3. .5. .1. .3. .4. .1
%e A269616 ..3. .5. .2. .2. .0. .4. .4. .4. .5. .3. .4. .2. .3. .5. .5. .3
%e A269616 ..4. .0. .5. .5. .5. .1. .0. .3. .1. .4. .1. .4. .5. .4. .3. .0
%Y A269616 Cf. A269619.
%K A269616 nonn
%O A269616 1,1
%A A269616 _R. H. Hardin_, Mar 01 2016