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 A115965 #9 May 11 2014 17:50:58
%S A115965 1,2,9,96,2498,161422,26217833,10794429504
%N A115965 Number of planar subpartitions of size n pyramidal planar partition.
%C A115965 This is a 2-dimensional analog of the Catalan numbers C_n (A000108). The number of subpartitions of the triangular partition [n,n-1,...,1] is C_{n+1}. The planar partition having its subpartitions counted is:
%C A115965 n n-1 ... 2 1
%C A115965 n-1 n-2 ... 1
%C A115965 ... ...
%C A115965 2 1
%C A115965 1
%H A115965 Oleg Lazarev, Matt Mizuhara, Ben Reid, <a href="http://www.math.oregonstate.edu/~swisherh/LazarevMizuharaReid.pdf">Some Results in Partitions, Plane Partitions, and Multipartitions</a>
%e A115965 The 9 planar subpartitions of [2,1|1] are [], [1], [2], [1,1], [1|1], [2,1], [2|1], [1,1|1] and [2,1|1] itself, so a(2)=9. (Here "," separates values on the same line and "|" separates lines.)
%Y A115965 Cf. A115728, A115729, A000219, A000108, A008793.
%K A115965 more,nonn
%O A115965 0,2
%A A115965 _Franklin T. Adams-Watters_, Mar 14 2006