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 A215687 #18 Jul 19 2017 20:49:46
%S A215687 0,16,174,690,1876,4140,7986,14014,22920,35496,52630,75306,104604,
%T A215687 141700,187866,244470,312976,394944,492030,605986,738660,891996,
%U A215687 1068034,1268910,1496856,1754200,2043366,2366874,2727340,3127476,3570090,4058086,4594464,5182320
%N A215687 Number of solid standard Young tableaux of shape [[2*n,2],[2]].
%H A215687 Alois P. Heinz, <a href="/A215687/b215687.txt">Table of n, a(n) for n = 0..1000</a>
%H A215687 S. B. Ekhad, D. Zeilberger, <a href="https://arxiv.org/abs/1202.6229">Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux</a>, arXiv:1202.6229v1 [math.CO], 2012
%H A215687 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a>
%H A215687 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1).
%F A215687 G.f.: 2*(3*x^3-10*x^2+47*x+8)*x/(1-x)^5.
%F A215687 a(n) = n*(2*n-1)*(2*n^2+7*n+7).
%p A215687 a:= n-> (-7+(7+(12+4*n)*n)*n)*n;
%p A215687 seq(a(n), n=0..40);
%t A215687 LinearRecurrence[{5,-10,10,-5,1},{0,16,174,690,1876},40] (* _Harvey P. Dale_, Jul 08 2017 *)
%Y A215687 Row n=2 of A176129.
%K A215687 nonn,easy
%O A215687 0,2
%A A215687 _Alois P. Heinz_, Aug 20 2012