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”).

A184253
Number of strings of numbers x(i=1..n) in 0..5 with sum i^3*x(i) equal to n^3*5
0
1, 1, 2, 4, 10, 41, 135, 477, 1719, 5987, 20942, 72586, 245893, 825328, 2735778, 8923167, 28779207, 91732303, 288568276, 898134715, 2765300373, 8421195140, 25394904018, 75848295457, 224397367622, 658053395498, 1913298309395
OFFSET
1,3
COMMENTS
Column 5 of A184257
EXAMPLE
Some solutions for n=7
..1....5....1....0....0....4....3....5....5....4....3....1....5....1....2....4
..3....1....5....4....5....4....2....4....5....3....3....3....5....4....1....1
..0....1....2....1....1....1....4....1....2....1....5....5....4....0....1....3
..5....0....4....4....1....1....0....3....0....4....1....1....3....1....2....0
..1....1....4....5....2....0....0....1....5....3....5....4....1....4....0....2
..1....4....4....2....3....1....1....3....3....0....4....3....1....2....4....0
..3....2....0....1....2....4....4....2....1....3....0....1....3....2....2....4
CROSSREFS
Sequence in context: A153757 A159860 A013549 * A174136 A125805 A344790
KEYWORD
nonn
AUTHOR
R. H. Hardin Jan 10 2011
STATUS
approved