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 A184705 #9 Apr 14 2018 13:11:26 %S A184705 3,12,34,78,156,282,471,744,1119,1623,2279,3118,4167,5463,7039,8935, %T A184705 11188,13845,16946,20545,24685,29424,34812,40911,47775,55472,64060, %U A184705 73612,84190,95874,108729,122840,138277,155129,173473,193402,214995,238353 %N A184705 Number of strings of numbers x(i=1..5) in 0..n with sum i*x(i) equal to n*5. %C A184705 Row 5 of A184703. %H A184705 R. H. Hardin, <a href="/A184705/b184705.txt">Table of n, a(n) for n = 1..200</a> %F A184705 Empirical: a(n) = a(n-1) + a(n-2) - a(n-5) - a(n-6) - a(n-7) + a(n-8) + a(n-9) + a(n-10) - a(n-13) - a(n-14) + a(n-15). %F A184705 Empirical g.f.: x*(3 + 9*x + 19*x^2 + 32*x^3 + 44*x^4 + 51*x^5 + 48*x^6 + 40*x^7 + 25*x^8 + 13*x^9 + 4*x^10 + x^11 - x^12 - x^13 + x^14) / ((1 - x)^5*(1 + x)^2*(1 + x^2)*(1 + x + x^2)*(1 + x + x^2 + x^3 + x^4)). - _Colin Barker_, Apr 14 2018 %e A184705 Some solutions for n=3: %e A184705 ..0....0....3....1....2....2....2....3....0....0....1....2....1....2....2....1 %e A184705 ..1....2....1....1....2....1....0....0....2....0....2....0....2....0....2....0 %e A184705 ..1....1....2....1....3....1....3....1....2....2....2....1....0....0....0....2 %e A184705 ..0....2....1....1....0....2....1....1....0....1....1....0....0....2....1....2 %e A184705 ..2....0....0....1....0....0....0....1....1....1....0....2....2....1....1....0 %Y A184705 Cf. A184703. %K A184705 nonn %O A184705 1,1 %A A184705 _R. H. Hardin_, Jan 20 2011