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.

A229015 Number of arrays of median of three adjacent elements of some length 7 0..n array, with no adjacent equal elements in the latter.

Original entry on oeis.org

2, 57, 332, 1145, 3002, 6635, 13040, 23515, 39698, 63605, 97668, 144773, 208298, 292151, 400808, 539351, 713506, 929681, 1195004, 1517361, 1905434, 2368739, 2917664, 3563507, 4318514, 5195917, 6209972, 7375997, 8710410, 10230767
Offset: 1

Views

Author

R. H. Hardin, Sep 10 2013

Keywords

Examples

			Some solutions for n=4:
..3....2....2....3....4....0....3....2....2....3....1....2....0....2....2....0
..2....1....2....1....0....4....3....3....3....2....1....2....2....2....0....2
..4....2....1....3....4....0....1....0....0....2....3....0....3....4....2....3
..1....3....4....1....1....3....1....3....3....1....0....3....3....0....0....4
..4....4....2....1....4....0....3....0....3....4....3....3....4....1....4....3
		

Crossrefs

Row 5 of A229012.

Formula

Empirical: a(n) = (19/60)*n^5 + (37/12)*n^4 + (19/12)*n^3 - (61/12)*n^2 + (31/10)*n - 1.
Conjectures from Colin Barker, Sep 13 2018: (Start)
G.f.: x*(2 + 45*x + 20*x^2 - 32*x^3 + 2*x^4 + x^5) / (1 - x)^6.
a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) for n>6.
(End)