cp's OEIS Frontend

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.

A116412 Riordan array ((1+x)/(1-2x),x(1+x)/(1-2x)).

This page as a plain text file.
%I A116412 #37 Oct 29 2022 16:06:59
%S A116412 1,3,1,6,6,1,12,21,9,1,24,60,45,12,1,48,156,171,78,15,1,96,384,558,
%T A116412 372,120,18,1,192,912,1656,1473,690,171,21,1,384,2112,4608,5160,3225,
%U A116412 1152,231,24,1,768,4800,12240,16584,13083,6219,1785,300,27,1,1536,10752
%N A116412 Riordan array ((1+x)/(1-2x),x(1+x)/(1-2x)).
%C A116412 Row sums are A003688. Diagonal sums are A116413. Product of A007318 and A116413 is A116414. Product of A007318 and A105475.
%C A116412 Subtriangle of triangle given by  (0, 3, -1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938. - _Philippe Deléham_, Jan 18 2012
%H A116412 Michael De Vlieger, <a href="/A116412/b116412.txt">Table of n, a(n) for n = 0..11475</a>
%H A116412 Milan Janjić, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL21/Janjic/janjic93.html">Words and Linear Recurrences</a>, J. Int. Seq. 21 (2018), #18.1.4.
%H A116412 Vladimir Kruchinin and D. V. Kruchinin, <a href="http://arxiv.org/abs/1103.2582">Composita and their properties</a>, arXiv:1103.2582 [math.CO], 2011-2013.
%F A116412 Number triangle T(n,k)=sum{j=0..n, C(k+1,j)*C(n-j,k)2^(n-k-j)}
%F A116412 From _Vladimir Kruchinin_, Mar 17 2011: (Start)
%F A116412 T((m+1)*n+r-1, m*n+r-1) * r/(m*n+r) = sum(k=1..n, k/n * T((m+1)*n-k-1, m*n-1) * T(r+k-1,r-1)), n>=m>1.
%F A116412 T(n-1,m-1) = m/n * sum(k=1..n-m+1, k*A003945(k-1)*T(n-k-1,m-2)), n>=m>1. (End)
%F A116412 G.f.: (1+x)/(1-(y+2)*x -y*x^2). - _Philippe Deléham_, Jan 18 2012
%F A116412 Sum_{k, 0<=k<=n} T(n,k)*x^k = A104537(n), A110523(n), (-2)^floor(n/2), A057079(n), A003945(n), A003688(n+1), A123347(n), A180035(n) for x = -4, -3, -2, -1, 0, 1, 2, 3 respectively. - _Philippe Deléham_, Jan 18 2012
%F A116412 T(n,k) = 2*T(n-1,k) + T(n-1,k-1) + T(n-2,k-1), T(0,0) = 1, T(1,0) = 3, T(1,1) = 1, T(2,0) = T(2,1) = 6, T(2,2) = 1, T(n,k) = 0 if k>n or if k<0. - _Philippe Deléham_, Oct 31 2013
%e A116412 Triangle begins
%e A116412 1,
%e A116412 3, 1,
%e A116412 6, 6, 1,
%e A116412 12, 21, 9, 1,
%e A116412 24, 60, 45, 12, 1,
%e A116412 48, 156, 171, 78, 15, 1
%e A116412 Triangle T(n,k), 0<=k<=n, given by (0, 3, -1, 0, 0, 0, ...) DELTA (1, 0, 0, 0, 0, ...) begins :
%e A116412 1
%e A116412 0, 1
%e A116412 0, 3, 1
%e A116412 0, 6, 6, 1
%e A116412 0, 12, 21, 9, 1
%e A116412 0, 24, 60, 45, 12, 1
%e A116412 0, 48, 156, 171, 78, 15, 1
%e A116412 ... - _Philippe Deléham_, Jan 18 2012
%t A116412 With[{n = 10}, DeleteCases[#, 0] & /@ CoefficientList[Series[(1 + x)/(1 - (y + 2) x - y x^2), {x, 0, n}, {y, 0, n}], {x, y}]] // Flatten (* _Michael De Vlieger_, Apr 25 2018 *)
%Y A116412 Cf. A003688, A003945.
%K A116412 easy,nonn,tabl
%O A116412 0,2
%A A116412 _Paul Barry_, Feb 13 2006