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.

A183961 Number of strings of numbers x(i=1..10) in 0..n with sum i^2*x(i) equal to n*100.

Original entry on oeis.org

3, 77, 771, 4987, 23044, 85595, 268008, 737538, 1830390, 4178324, 8894137, 17852441, 34075582, 62278704, 109576019, 186449688, 307961403, 495340098, 777909895, 1195576284, 1801779972, 2667185951, 3883983063, 5571216259
Offset: 1

Views

Author

R. H. Hardin Jan 08 2011

Keywords

Comments

Row 10 of A183953

Examples

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