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.

A184711 Number of strings of numbers x(i=1..11) in 0..n with sum i*x(i) equal to n*11.

Original entry on oeis.org

12, 215, 1901, 11071, 48701, 175410, 543050, 1493647, 3734127, 8629470, 18668476, 38179126, 74385462, 138932619, 250023457, 435361212, 736109581, 1212153012, 1948954846, 3066408954, 4730088166, 7165425434, 10675359121, 15662148169
Offset: 1

Views

Author

R. H. Hardin Jan 20 2011

Keywords

Comments

Row 11 of A184703

Examples

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