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.

A200157 Number of 0..n arrays x(0..5) of 6 elements with zero 5th difference.

Original entry on oeis.org

8, 39, 112, 275, 730, 1589, 3000, 5181, 8350, 13871, 21588, 32019, 45682, 63225, 88580, 120521, 159996, 208123, 266020, 342493, 433532, 540855, 666180, 811455, 992870, 1201725, 1440468, 1711817, 2018490, 2387707, 2803024, 3268059, 3786430
Offset: 1

Views

Author

R. H. Hardin Nov 13 2011

Keywords

Comments

Row 6 of A200154

Examples

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

Formula

Empirical: a(n) = 2*a(n-1) -a(n-2) +2*a(n-5) -4*a(n-6) +2*a(n-7) +a(n-10) -2*a(n-11) +a(n-12) -4*a(n-15) +8*a(n-16) -4*a(n-17) +a(n-20) -2*a(n-21) +a(n-22) +2*a(n-25) -4*a(n-26) +2*a(n-27) -a(n-30) +2*a(n-31) -a(n-32)