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 A182316 #17 Feb 09 2019 02:23:21
%S A182316 1,1,5,51,819,18278,527085,18730855,793542167,39113958819,
%T A182316 2201663313200,139461523272085,9824294829146550,762188806010669820,
%U A182316 64595315110014533629,5939055918736259991759,588894813538193130767295,62651281502108852275337225
%N A182316 a(n) = binomial(n^2 + 3*n, n) / (n+1)^2.
%C A182316 a(n) = < PF_n, PF_n >, where PF_n is the parking function symmetric function and <,> denotes the usual scalar product on symmetric functions (proved). - _Richard Stanley_, Sep 24 2015
%H A182316 Seiichi Manyama, <a href="/A182316/b182316.txt">Table of n, a(n) for n = 0..339</a>
%F A182316 a(n) = [x^n] 1/(1-x)^((n+1)^2) / (n+1)^2 ; that is, a(n) equals the coefficient of x^n in 1/(1-x)^((n+1)^2) divided by (n+1)^2.
%p A182316 A182316:=n->binomial(n^2 + 3*n, n) / (n+1)^2: seq(A182316(n), n=0..20); # _Wesley Ivan Hurt_, Feb 11 2017
%o A182316 (PARI) {a(n)=binomial((n+1)^2+n-1, n)/(n+1)^2}
%o A182316 for(n=0,20,print1(a(n),","))
%Y A182316 Cf. A143669.
%K A182316 nonn,easy
%O A182316 0,3
%A A182316 _Paul D. Hanna_, Apr 24 2012