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 A102420 #12 Sep 18 2013 21:19:49
%S A102420 0,0,0,0,0,1,1,2,3,5,6,8,9,11,11,12,11,11,9,8,6,5,3,2,1,1,0,0,0,0,0,0,
%T A102420 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A102420 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A102420 Number of partitions of n into exactly k = 5 parts with each part p <= 5.
%C A102420 There are only 26 nonzero terms.
%C A102420 a(n) is also the number of partitions of n-1 into exactly 4 parts with each part p in the range 1 <= p <= 6; i.e. the number of ways of arriving at a total of n-1 with 4 6-sided dice. - _Toby Gottfried_, Feb 19 2009
%F A102420 G.f.:z^5+z^6+2*z^7+3*z^8+5*z^9+6*z^10+8*z^11+9*z^12+11*z^13 +11*z^14 +12*z^15+ 11*z^16+11*z^17+9*z^18+8*z^19+6*z^20+5*z^21+3*z^22 +2*z^23 +z^24 +z^25.
%e A102420 a(8) = 3 because we can write 8=1+1+1+2+3 or 1+1+1+1+4 or 1+1+2+2+2.
%t A102420 Table[Count[IntegerPartitions[n,{5}],_?(Max[#]<6&)],{n,0,110}] (* _Harvey P. Dale_, Nov 29 2012 *)
%Y A102420 Cf. A000041, A102422, A036606.
%K A102420 easy,nonn
%O A102420 0,8
%A A102420 _Thomas Wieder_, Jan 09 2005