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.

A242150 Number of length 6+5 0..n arrays with no consecutive six elements summing to more than 3*n.

Original entry on oeis.org

747, 51440, 1098260, 12043599, 86052208, 456215409, 1941492045, 6980495147, 21963123129, 62016006945, 160112849845, 383388390463, 860906165796, 1828944557550, 3702209669222, 7182352124565, 13418860449679, 24241936676342
Offset: 1

Views

Author

R. H. Hardin, May 05 2014

Keywords

Comments

Row 6 of A242144

Examples

			Some solutions for n=1
..0....0....1....0....0....1....1....1....1....1....0....0....1....0....1....1
..0....0....0....0....0....0....0....1....1....0....0....0....1....1....0....1
..1....0....0....0....1....0....1....0....1....0....0....0....0....0....0....1
..0....0....0....0....0....0....0....0....0....1....0....1....1....1....0....0
..0....1....0....1....1....1....0....0....0....0....0....1....0....1....0....0
..1....1....0....0....0....0....0....1....0....0....0....0....0....0....0....0
..1....0....0....0....1....0....0....1....1....0....1....1....1....0....0....0
..0....0....0....0....0....0....1....0....1....1....0....0....0....1....1....0
..0....1....0....1....0....0....0....0....1....1....1....0....0....0....0....0
..0....0....1....0....0....0....0....0....0....0....0....1....1....1....0....0
..1....1....0....1....0....1....1....0....0....1....0....1....0....1....0....0
		

Formula

Empirical: a(n) = (1956631/9979200)*n^11 + (1726129/725760)*n^10 + (9526243/725760)*n^9 + (5272471/120960)*n^8 + (19548049/201600)*n^7 + (5255677/34560)*n^6 + (124917323/725760)*n^5 + (25617881/181440)*n^4 + (75074821/907200)*n^3 + (83833/2520)*n^2 + (115589/13860)*n + 1