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 A190726 #28 Jul 18 2018 17:37:20
%S A190726 1,6,62,720,8806,110916,1423796,18520788,243289670,3220011684,
%T A190726 42872967012,573608356272,7705343534716,103857425975400,
%U A190726 1403902871946000,19024773303675420,258372666772083270,3515644245559211172,47918193512409831380
%N A190726 Central coefficients of Riordan matrix A118384.
%C A190726 This sequence gives the integer part of an integral approximation to log(2), thus bears strong similarity to A123178. Quality of rational approximants appears entirely sufficient to prove irrationality. - _Bradley Klee_, Jun 29 2018
%H A190726 Vincenzo Librandi, <a href="/A190726/b190726.txt">Table of n, a(n) for n = 0..88</a>
%H A190726 Wadim Zudilin, <a href="https://arxiv.org/abs/math/0404523"> An essay on irrationality measures of pi and other logarithms</a>, arXiv:math/0404523 [math.NT], 2004.
%F A190726 a(n) = T(2*n,n), where T(n,k) = A118384(n,k).
%F A190726 a(n) = Sum_{k=0..n} binomial(2*n, k)*binomial(2*n, n-k)*2^k.
%F A190726 a(n) = Sum_{k=0..n} binomial(2*n, k)*binomial(k, n-k)*2^(n-k)*3^(2*k-n).
%F A190726 From _Bradley Klee_, Jun 29 2018: (Start)
%F A190726 a(n)*log(2) - A316911(n)/A316912(n) = I_n = Integral_{t=0..1}(-1/2)^n/(1+t)*((1-t)^2*t^2/(1+t))^n*dt.
%F A190726 Lim_{n->oo} I_n = 0, therefore:
%F A190726 Lim_{n->oo} A316911(n)/A316912(n)/a(n) = log(2).
%F A190726 G.f. G(x) and derivatives G^(n)(x) = d^n/dx^n G(x) satisfy a Picard-Fuchs type differential equation, 0 = Sum_{m=0..5,n=0..3} M_{m,n} x^m G^(n)(x), with integer matrix: M = {{324,-54,0,0}, {-36,10842,-486,0}, {84,8352,14931,-243}, {0,756,19026,3024}, {0,0,672,5364}, {0,0,0,112}}.
%F A190726 2*(n-1)*(2*n-3)*(2*n-1)*(33*n-8)*a(n-2)+ 9*(2*n-1)*(693*n^3-1554*n^2+989*n-160)*a(n-1) -3*n*(3*n-2)*(3*n-1)*(33*n-41)*a(n)=0.
%F A190726 (End)
%e A190726 From _Bradley Klee_, Jul 16 2018: (Start)
%e A190726 I_2 = Integral_{t=0..1} ((1-t)^4*t^4)/(4*(1+t)^3)*dt = 62*log(2) - 1719/40 < 10^(-3).
%e A190726 I_3 = Integral_{t=0..1} - ((1-t)^6*t^6)/(8*(1+t)^4)*dt = 720*log(2) - 143731/288 < 10^(-5). (End)
%t A190726 Table[Sum[Binomial[2n,k]Binomial[2n,n-k]2^k,{k,0,n}],{n,0,100}]
%t A190726 RecurrenceTable[{2*(n-1)*(2*n-3)*(2*n-1)*(33*n-8)*a[n-2]+ 9*(2*n-1)*(693*n^3-1554*n^2+989*n-160)*a[n-1] -3*n*(3*n-2)*(3*n-1)*(33*n-41)*a[n]==0, a[0]==1,a[1]==6},a,{n,0,10}] (* _Bradley Klee_, Jun 29 2018 *)
%o A190726 (Maxima) makelist(sum(binomial(2*n,k)*binomial(2*n,n-k)*2^k,k,0,n),n,0,12);
%o A190726 (PARI) a(n)=sum(k=0,n,binomial(2*n,k)*binomial(2*n,n-k)<<k) \\ _Charles R Greathouse IV_, Jun 29 2011
%Y A190726 Cf. A118384, A123178.
%Y A190726 Log(2) approximation rationals: A316911, A316912.
%Y A190726 Cf. A123178.
%K A190726 nonn
%O A190726 0,2
%A A190726 _Emanuele Munarini_, May 17 2011