A183959 Number of strings of numbers x(i=1..8) in 0..n with sum i^2*x(i) equal to n*64.

1, 20, 147, 649, 2195, 6301, 15601, 34847, 71509, 137520, 249799, 433038, 720820, 1159650, 1809461, 2749459, 4079634, 5928317, 8451964, 11845820, 16345291, 22238744, 29865253, 39632411, 52016744, 67583239, 86980484, 110967120

Offset: 1

Author

R. H. Hardin Jan 08 2011

Keywords

• nonn

Comments

Row 8 of A183953

Examples

			Some solutions for n=3
..1....1....2....0....3....0....2....3....1....2....0....3....1....2....1....1
..2....3....0....0....0....3....1....1....1....3....0....2....3....2....1....2
..0....2....3....3....0....2....2....1....0....1....0....3....0....0....2....0
..0....0....0....1....1....3....2....1....3....1....2....2....2....0....3....0
..0....1....2....0....3....2....0....3....3....1....3....2....3....1....0....3
..1....2....0....1....0....0....2....1....0....0....1....2....2....3....2....3
..3....0....1....1....2....0....0....1....0....0....1....0....0....1....1....0
..0....1....1....1....0....1....1....0....1....2....0....0....0....0....0....0
		

Links

• R. H. Hardin, Table of n, a(n) for n = 1..200