The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237619 Riordan array (1/(1+x*c(x)), x*c(x)) where c(x) is the g.f. of Catalan numbers (A000108). 2

%I #10 May 28 2022 04:02:48

%S 1,-1,1,0,0,1,-1,1,1,1,-2,2,3,2,1,-6,6,8,6,3,1,-18,18,24,18,10,4,1,

%T -57,57,75,57,33,15,5,1,-186,186,243,186,111,54,21,6,1,-622,622,808,

%U 622,379,193,82,28,7,1,-2120,2120,2742,2120,1312,690,311,118,36,8,1

%N Riordan array (1/(1+x*c(x)), x*c(x)) where c(x) is the g.f. of Catalan numbers (A000108).

%H G. C. Greubel, <a href="/A237619/b237619.txt">Rows n = 0..50 of the triangle, flattened</a>

%F Sum_{k=0..n} T(n,k)*x^k = A126983(n), A000957(n+1), A026641(n) for x = 0, 1, 2 respectively.

%F T(n, k) = A167772(n-1, k-1) for k > 0, with T(n, 0) = A167772(n, 0).

%F T(n, 0) = A126983(n).

%F T(n+1, 1) = A000957(n+1).

%F T(n+2, 2) = A000958(n+1).

%F T(n+3, 3) = A104629(n) = A000957(n+3).

%F T(n+4, 4) = A001558(n).

%F T(n+5, 5) = A001559(n).

%F T(n, k) = A065602(n, k) for k > 0, with T(n, k) = (-1)^(n-k), for n < 2, and T(n, 0) = A065602(n, 0). - _G. C. Greubel_, May 27 2022

%e Triangle begins:

%e 1;

%e -1, 1;

%e 0, 0, 1;

%e -1, 1, 1, 1;

%e -2, 2, 3, 2, 1;

%e -6, 6, 8, 6, 3, 1;

%e -18, 18, 24, 18, 10, 4, 1;

%e -57, 57, 75, 57, 33, 15, 5, 1;

%e Production matrix begins:

%e -1, 1;

%e -1, 1, 1;

%e -1, 1, 1, 1;

%e -1, 1, 1, 1, 1;

%e -1, 1, 1, 1, 1, 1;

%e -1, 1, 1, 1, 1, 1, 1;

%e -1, 1, 1, 1, 1, 1, 1, 1;

%e -1, 1, 1, 1, 1, 1, 1, 1, 1;

%t A065602[n_, k_]:= A065602[n, k]= Sum[(k-1+2*j)*Binomial[2*(n-j)-k-1, n-1]/(2*(n - j) -k-1), {j,0,(n-k)/2}];

%t T[n_, k_]:= If[k==0, A065602[n, 0], If[n==1 && k==1, 1, A065602[n, k]]];

%t Table[T[n, k], {n,0,12}, {k,0,n}]//Flatten (* _G. C. Greubel_, May 27 2022 *)

%o (SageMath)

%o def A065602(n, k): return sum( (k+2*j-1)*binomial(2*n-2*j-k-1, n-1)/(2*n-2*j-k-1) for j in (0..(n-k)//2) )

%o def A237619(n, k):

%o if (n<2): return (-1)^(n-k)

%o elif (k==0): return A065602(n, 0)

%o else: return A065602(n, k)

%o flatten([[A237619(n, k) for k in (0..n)] for n in (0..12)]) # _G. C. Greubel_, May 27 2022

%Y Diagonals: A000012, A000217, A023443, A166830.

%Y Cf. A000957, A000958, A001558, A001559, A104629, A126983.

%Y Cf. A065602, A167772.

%K sign,tabl

%O 0,11

%A _Philippe Deléham_, Feb 10 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 7 17:32 EDT 2024. Contains 373203 sequences. (Running on oeis4.)