login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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.
1
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,2
COMMENTS
Row 4 of A184318.
LINKS
EXAMPLE
All solutions for n=5
..0
..0
..0
..5
CROSSREFS
Cf. A184318.
Sequence in context: A160989 A066788 A160988 * A160987 A230773 A338732
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 10 2011
STATUS
approved