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.

A222552 Number of (n+5)X1 arrays of occupancy after each element moves up to +-5 places but not 0.

Original entry on oeis.org

456, 1668, 6220, 23341, 87752, 330274, 1244135, 4688684, 17678240, 66670133, 251457191, 948433758, 3577222198, 13491914845, 50884787739, 191905944304, 723728206116, 2729294349873, 10292348908806, 38812294765020
Offset: 1

Views

Author

R. H. Hardin Feb 24 2013

Keywords

Comments

Column 5 of A222555

Examples

			Some solutions for n=3
..0....2....1....0....0....1....1....0....0....3....0....0....1....1....0....0
..0....0....2....1....2....0....6....0....0....0....3....0....0....0....0....4
..3....0....1....1....2....0....0....0....1....1....0....4....2....2....0....0
..3....2....1....0....0....4....0....0....0....1....0....0....0....0....2....1
..0....2....0....5....1....1....0....4....0....0....0....0....0....0....1....3
..1....0....0....0....1....0....0....0....1....1....2....4....1....3....0....0
..0....0....3....1....0....1....1....2....3....2....0....0....2....2....2....0
..1....2....0....0....2....1....0....2....3....0....3....0....2....0....3....0
		

Formula

Empirical: a(n) = 11*a(n-1) -45*a(n-2) +84*a(n-3) -70*a(n-4) +21*a(n-5) +18*a(n-6) -200*a(n-7) +753*a(n-8) -1183*a(n-9) +631*a(n-10) +8*a(n-11) -2*a(n-12) +58*a(n-13) -32*a(n-14) -6*a(n-15)