This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A183959 #7 Jun 02 2025 03:23:42 %S A183959 1,20,147,649,2195,6301,15601,34847,71509,137520,249799,433038,720820, %T A183959 1159650,1809461,2749459,4079634,5928317,8451964,11845820,16345291, %U A183959 22238744,29865253,39632411,52016744,67583239,86980484,110967120 %N A183959 Number of strings of numbers x(i=1..8) in 0..n with sum i^2*x(i) equal to n*64. %C A183959 Row 8 of A183953 %H A183959 R. H. Hardin, <a href="/A183959/b183959.txt">Table of n, a(n) for n = 1..200</a> %e A183959 Some solutions for n=3 %e A183959 ..1....1....2....0....3....0....2....3....1....2....0....3....1....2....1....1 %e A183959 ..2....3....0....0....0....3....1....1....1....3....0....2....3....2....1....2 %e A183959 ..0....2....3....3....0....2....2....1....0....1....0....3....0....0....2....0 %e A183959 ..0....0....0....1....1....3....2....1....3....1....2....2....2....0....3....0 %e A183959 ..0....1....2....0....3....2....0....3....3....1....3....2....3....1....0....3 %e A183959 ..1....2....0....1....0....0....2....1....0....0....1....2....2....3....2....3 %e A183959 ..3....0....1....1....2....0....0....1....0....0....1....0....0....1....1....0 %e A183959 ..0....1....1....1....0....1....1....0....1....2....0....0....0....0....0....0 %K A183959 nonn %O A183959 1,2 %A A183959 _R. H. Hardin_ Jan 08 2011