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 A082970 #15 Dec 25 2018 13:16:46
%S A082970 4,23,107,464,1950,8063,33033,134576,546312,2212550,8946454,36134656,
%T A082970 145831270,588199815,2371435125,9557736480,38511326040,155143873170,
%U A082970 624899673690,2516678580000,10134353299980,40805797511622
%N A082970 Number of permutations of length n containing 2 occurrences of 132.
%H A082970 T. Mansour and A. Vainshtein, <a href="http://arXiv.org/abs/math.CO/0105073">Counting occurrences of 132 in a permutation</a>, arXiv:math/0105073 [math.CO], 2001.
%F A082970 a(n) = C(2*n-6,n-2)*(n^3+17*n^2-80*n+80)/(2n(n-1)).
%t A082970 Table[Binomial[2n-6,n-2] (n^3+17n^2-80n+80)/(2n(n-1)),{n,4,30}] (* _Harvey P. Dale_, Dec 25 2018 *)
%o A082970 (PARI) a(n)=binomial(2*n-6,n-2)*(n^3+17*n^2-80*n+80)/2/n/(n-1)
%Y A082970 Column k=2 of A263771.
%K A082970 nonn
%O A082970 4,1
%A A082970 _Benoit Cloitre_, May 27 2003