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 A111959 #29 Aug 31 2021 02:56:38 %S A111959 1,0,1,2,0,1,0,4,0,1,6,0,6,0,1,0,16,0,8,0,1,20,0,30,0,10,0,1,0,64,0, %T A111959 48,0,12,0,1,70,0,140,0,70,0,14,0,1,0,256,0,256,0,96,0,16,0,1,252,0, %U A111959 630,0,420,0,126,0,18,0,1,0,1024,0,1280,0,640,0,160,0,20,0,1,924,0,2772,0 %N A111959 Renewal array for aerated central binomial coefficients. %C A111959 Row sums are A098615. %C A111959 Binomial transform (product with C(n,k)) is A111960. %C A111959 Diagonal sums are A026671 (with interpolated zeros). %C A111959 Inverse is (1/sqrt(1+4x^2),x/sqrt(1+4x^2)), or (sqrt(-1))^(n-k)*T(n,k). [corrected by _Peter Bala_, Aug 13 2021] %C A111959 The Riordan array (1,x/sqrt(1-4*x^2)) is the same array with an additional column of zeros (besides the top element 1) added to the left. - _Vladimir Kruchinin_, Feb 17 2011 %H A111959 Paul Barry, <a href="https://arxiv.org/abs/2101.10218">On the duals of the Fibonacci and Catalan-Fibonacci polynomials and Motzkin paths</a>, arXiv:2101.10218 [math.CO], 2021. %H A111959 Vladimir Kruchinin, <a href="http://arxiv.org/abs/1009.2565">Composition of ordinary generating functions</a>, arXiv:1009.2565 [math.CO], 2010. %F A111959 Riordan array (1/sqrt(1-4x^2), x/sqrt(1-4x^2)); number triangle T(n, k)=(1+(-1)^(n-k))*binomial((n-1)/2, (n-k)/2)*2^(n-k)/2. %F A111959 G.f.: 1/(1-xy-2x^2/(1-x^2/(1-x^2/(1-x^2/(1-.... (continued fraction). - _Paul Barry_, Jan 28 2009 %F A111959 From _Peter Bala_, Aug 13 2021: (Start) %F A111959 T(2*n,2*k) = A046521(n,k); T(2*n+1,2*k+1) = A038231(n,k). %F A111959 The row entries, read from right to left, are the coefficients in the n-th order Taylor polynomial of (sqrt(1 + 4*x^2))^((n-1)/2) at x = 0. %F A111959 The infinitesimal generator of this array has the sequence [2, 4, 6, 8, 10, ...] on the second subdiagonal below the main diagonal and zeros elsewhere. %F A111959 The m-th power of the array is the Riordan array (1/sqrt(1 - 4*m*x^2), x/sqrt(1 - 4*m*x^2)) with entries given by sqrt(m)^(n-k)*T(n,k). (End) %e A111959 From _Peter Bala_, Aug 13 2021: (Start) %e A111959 Triangle begins %e A111959 1; %e A111959 0, 1; %e A111959 2, 0, 1; %e A111959 0, 4, 0, 1; %e A111959 6, 0, 6, 0, 1; %e A111959 0, 16, 0, 8, 0, 1; %e A111959 Infinitesimal generator begins %e A111959 0; %e A111959 0, 0; %e A111959 2, 0, 0; %e A111959 0, 4, 0, 0; %e A111959 0, 0, 6, 0, 0; %e A111959 0, 0, 0, 8, 0, 0; (End) %Y A111959 Cf. A054335, A038231, A046521. %K A111959 easy,nonn,tabl %O A111959 0,4 %A A111959 _Paul Barry_, Aug 23 2005