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

A184433
Number of strings of numbers x(i=1..n) in 0..n with sum i*x(i)^2 equal to n^3
0
1, 1, 2, 10, 39, 436, 3818, 38560, 513211, 6729888, 94975257, 1514956607, 24870079005, 430238381615, 7946503640262, 151928007427027, 3024975882657404, 62893815171137570
OFFSET
1,3
COMMENTS
Diagonal of A184441
EXAMPLE
Some solutions for n=5
..5....3....4....2....5....1....0....3....0....0....4....1....0....0....2....3
..2....2....0....3....0....4....5....0....2....3....1....0....1....0....0....4
..2....1....4....1....0....2....5....0....2....3....3....5....3....0....2....0
..0....5....2....5....5....0....0....3....5....0....0....1....2....0....4....4
..4....1....3....0....0....4....0....4....1....4....4....3....4....5....3....2
CROSSREFS
Sequence in context: A151311 A151312 A253590 * A339090 A244376 A009338
KEYWORD
nonn
AUTHOR
R. H. Hardin Jan 14 2011
STATUS
approved