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 A238562 #7 Jun 05 2015 16:57:09
%S A238562 0,1,13,1365,1736385,33432635477,10815459920194632,
%T A238562 62725487942251841319705,6831392910998237157682785667015,
%U A238562 14474273684384810126076369987535894403747,613458701796516369003780850311157775345255117642867
%N A238562 Number of partitions of 5^n into parts that are at most n.
%H A238562 Alois P. Heinz, <a href="/A238562/b238562.txt">Table of n, a(n) for n = 0..40</a>
%F A238562 a(n) = [x^(5^n)] Product_{j=1..n} 1/(1-x^j).
%F A238562 a(n) ~ 5^(n*(n-1)) / (n!*(n-1)!). - _Vaclav Kotesovec_, Jun 05 2015
%e A238562 a(2) = 13: 2222222222221, 22222222222111, 222222222211111, 2222222221111111, 22222222111111111, 222222211111111111, 2222221111111111111, 22222111111111111111, 222211111111111111111, 2221111111111111111111, 22111111111111111111111, 211111111111111111111111, 1111111111111111111111111.
%Y A238562 Column k=5 of A238010.
%K A238562 nonn
%O A238562 0,3
%A A238562 _Alois P. Heinz_, Feb 28 2014