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

A184440
Number of strings of numbers x(i=1..n) in 0..8 with sum i*x(i)^2 equal to n*64
1
1, 1, 3, 28, 146, 1160, 6805, 38560, 248861, 1376999, 7346823, 40066933, 205138785, 1021202011, 5016967826, 23832660309, 110581697393, 503553260431, 2240165792600, 9769058509321, 41836840405957, 175853358107466
OFFSET
1,3
COMMENTS
Column 8 of A184441
LINKS
EXAMPLE
Some solutions for n=5
..1....0....3....5....0....1....1....5....4....8....7....3....4....7....0....3
..5....8....2....1....8....1....2....7....4....2....8....4....6....2....4....1
..6....8....3....4....4....8....7....4....8....1....3....1....4....7....3....4
..3....0....8....0....4....0....6....6....0....0....3....7....1....3....8....8
..5....0....2....7....4....5....2....1....4....7....4....4....6....4....1....1
CROSSREFS
Sequence in context: A095665 A145346 A378934 * A012762 A012778 A302522
KEYWORD
nonn
AUTHOR
R. H. Hardin Jan 14 2011
STATUS
approved