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 A183952 #7 Jun 02 2025 03:23:26 %S A183952 1,3,9,48,259,1387,7099,34847,163588,737538,3200055,13400036,54289217, %T A183952 213301597,814463579,3028171125,10981909481,38908787433,134868584027, %U A183952 457962911722,1525173224446,4987066348804,16026405323579,50662230359800 %N A183952 Number of strings of numbers x(i=1..n) in 0..8 with sum i^2*x(i) equal to n^2*8. %C A183952 Column 8 of A183953 %H A183952 R. H. Hardin, <a href="/A183952/b183952.txt">Table of n, a(n) for n = 1..37</a> %e A183952 Some solutions for n=4 %e A183952 ..1....7....5....0....3....4....4....0....1....2....8....2....8....3....4....8 %e A183952 ..1....8....7....2....5....1....7....0....0....2....6....3....4....1....2....8 %e A183952 ..3....1....7....8....1....8....0....0....7....6....0....2....8....1....4....8 %e A183952 ..6....5....2....3....6....3....6....8....4....4....6....6....2....7....5....1 %K A183952 nonn %O A183952 1,2 %A A183952 _R. H. Hardin_ Jan 08 2011