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 A293469 #11 Oct 18 2017 05:09:39
%S A293469 1,3,12,57,330,2436,23226,277389,3966534,65517210,1220999208,
%T A293469 25279328958,575024187192,14247595540542,381846383109030,
%U A293469 11004598454925405,339324532631899110,11146022446431209490,388535338484934710040,14324570939127320452350,556887682690152668745660
%N A293469 a(n) = Sum_{k=0..n} (2*k-1)!!*binomial(2*n-k, n).
%H A293469 Robert Israel, <a href="/A293469/b293469.txt">Table of n, a(n) for n = 0..403</a>
%H A293469 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>
%F A293469 a(n) = [x^n] 1/((1 - x)^(n+1)*(1 - x/(1 - 2*x/(1 - 3*x/(1 - 4*x/(1 - 5*x/(1 - 6*x/(1 - ...)))))))), a continued fraction.
%F A293469 a(n) = Gamma(n+1/2)*hypergeom([1/2, 1, -n], [-2*n], 2)*4^n/(n!*sqrt(Pi)). - _Robert Israel_, Oct 09 2017
%F A293469 a(n) ~ 2^(n + 1/2) * n^n / exp(n - 1/2). - _Vaclav Kotesovec_, Oct 18 2017
%p A293469 seq(add(doublefactorial(2*k-1)*binomial(2*n-k,n),k=0..n),n=0..40); # _Robert Israel_, Oct 09 2017
%t A293469 Table[Sum[(2 k - 1)!! Binomial[2 n - k, n], {k, 0, n}], {n, 0, 20}]
%t A293469 Table[SeriesCoefficient[(1/(1 - x)^(n + 1)) 1/(1 + ContinuedFractionK[-k x, 1, {k, 1, n}]), {x, 0, n}], {n, 0, 20}]
%t A293469 Table[SeriesCoefficient[(1/(1 - x)^(n + 1)) Sum[(2 k - 1)!! x^k, {k, 0, n}], {x, 0, n}], {n, 0, 20}]
%Y A293469 Cf. A001147, A076795, A084262, A092392, A270447, A293468.
%K A293469 nonn
%O A293469 0,2
%A A293469 _Ilya Gutkovskiy_, Oct 09 2017