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.

A184319 Number of strings of numbers x(i=1..4) in 0..n with sum i^2*x(i)^3 equal to 16*n^3.

Original entry on oeis.org

1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 4, 4, 1, 5, 2, 2, 2, 3, 1, 2, 3, 2, 5, 3, 1, 6, 4, 2, 2, 3, 2, 3, 2, 3, 7, 3, 1, 4, 1, 2, 6, 3, 1, 3, 3, 2, 3, 5, 1, 4, 6, 3, 3, 6, 1, 3, 2, 2, 2, 6, 1, 3, 5, 2, 5, 2, 1, 5, 6, 2, 7, 10, 1, 5, 7, 2, 9, 9, 2, 8, 1
Offset: 1

Views

Author

R. H. Hardin, Jan 10 2011

Keywords

Comments

Row 4 of A184318.

Examples

			All solutions for n=5
..0
..0
..0
..5
		

Crossrefs

Cf. A184318.