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!)
A298511 Central Lehmer-Comtet numbers of the first kind: a(n) = A008296(2n,n). 3

%I #16 Dec 01 2023 05:24:54

%S 1,1,-1,-15,49,1365,-7645,-311311,2475473,132652377,-1367593305,

%T -90881245455,1151541572401,91341008892445,-1373222414339685,

%U -126594821384553375,2202549127844351265,231390624855674406705,-4573116447815658471025,-539278542630309415030735

%N Central Lehmer-Comtet numbers of the first kind: a(n) = A008296(2n,n).

%H Alois P. Heinz, <a href="/A298511/b298511.txt">Table of n, a(n) for n = 0..386</a>

%F a(n) = (2*n)!/n! * [x^(2*n)] ((1+x)*log(1+x))^n.

%F a(n) = Sum_{j=0..n} binomial(n+j,n) * n^j * Stirling1(2*n,n+j).

%p b:= proc(n, k) option remember; `if`(n=k, 1, `if`(k=0, 0,

%p (n-1)*b(n-2, k-1)+b(n-1, k-1)+(k-n+1)*b(n-1, k)))

%p end:

%p a:= n-> b(2*n, n):

%p seq(a(n), n=0..25);

%t b[n_, k_] := b[n, k] = If[n == k, 1, If[k == 0, 0,

%t (n-1) b[n-2, k-1] + b[n-1, k-1] + (k-n+1) b[n-1, k]]];

%t a[n_] := b[2n, n];

%t Table[a[n], {n, 0, 25}] (* _Jean-François Alcover_, Dec 01 2023, from Maple code *)

%Y Cf. A008275, A008296, A048994.

%K sign

%O 0,4

%A _Alois P. Heinz_, Jan 20 2018

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 April 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)