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 A181088 #11 Apr 05 2021 00:07:06
%S A181088 1,-4,-40,672,8064,-253440,-3294720,153753600,2091048960,
%T A181088 -130025226240,-1820353167360,141707492720640,2024392753152000,
%U A181088 -189483161695027200,-2747505844577894400,300609462994993152000,4408938790593232896000
%N A181088 a(n) = A181089(2*n+1,n)/(n+2).
%C A181088 What are the constraints on left-right symmetric triangles t(n,m) such that t(2*n,n)/(n+1) are integers?
%H A181088 G. C. Greubel, <a href="/A181088/b181088.txt">Table of n, a(n) for n = 0..450</a>
%F A181088 a(n) = (A060821(2*n+1, n) + A060821(2*n+1, n+1))/(n+2). - _G. C. Greubel_, Apr 04 2021
%t A181088 (* First program *)
%t A181088 p[x_, n_] = HermiteH[n, x] + ExpandAll[x^n*HermiteH[n, 1/x]];
%t A181088 b:= Table[CoefficientList[p[x, n], x], {n, 0, 50}];
%t A181088 Table[b[[2*n+2, n+1]]/(n+2), {n,0,20}]
%t A181088 (* Second program *)
%t A181088 A060821[n_, k_]:= If[EvenQ[n-k], (-1)^(Floor[(n-k)/2])*2^k*n!/(k!*(Floor[(n - k)/2]!)), 0];
%t A181088 a[n_]:= (A060821[2*n+1, n] + A060821[2*n+1, n+1])/(n+2);
%t A181088 Table[a[n], {n, 0, 25}] (* _G. C. Greubel_, Apr 04 2021 *)
%o A181088 (Sage)
%o A181088 def A060821(n,k): return (-1)^((n-k)//2)*2^k*factorial(n)/(factorial(k)*factorial( (n-k)//2)) if (n-k)%2==0 else 0
%o A181088 def a(n): return (A060821(2*n+1, n) + A060821(2*n+1, n+1))/(n+2)
%o A181088 [a(n) for n in (0..25)] # _G. C. Greubel_, Apr 04 2021
%Y A181088 Cf. A060821, A177042, A177043, A181089.
%K A181088 sign
%O A181088 0,2
%A A181088 _Roger L. Bagula_, Oct 02 2010