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 A258283 #9 Apr 03 2017 10:04:46
%S A258283 1,1,6,8,29,47,134,213,559,939,2178,3564,8184,13225,27904,46376,93151,
%T A258283 153022,302948,489271,931845,1540667,2818014,4565768,8369128,13423638,
%U A258283 23782711,38552461,66714197,106889113,184313769,291358130,491972639,785299762,1298230358
%N A258283 Number of partitions of 5 copies of n into distinct parts.
%H A258283 Alois P. Heinz, <a href="/A258283/b258283.txt">Table of n, a(n) for n = 9..50</a>
%F A258283 a(n) = 1/5! * [(x*y*z*u*v)^n] Product_{j>0} (1+x^j+y^j+z^j+u^j+v^j).
%e A258283 a(11) = 6: [11;10,1;9,2;8,3;7,4], [11;10,1;9,2;8,3;6,5], [11;10,1;9,2;7,4;6,5], [11;10,1;8,3;7,4;6,5], [11;9,2;8,3;7,4;6,5], [10,1;9,2;8,3;7,4;6,5].
%Y A258283 Column k=5 of A258280.
%K A258283 nonn
%O A258283 9,3
%A A258283 _Alois P. Heinz_, May 25 2015