|
%I #28 Dec 01 2021 15:57:43
%S 1,2,11,100,1257,20076,387739,8766248,226739489,6595646860,
%T 212944033051,7550600079672,291527929539433,12169325847587832,
%U 545918747361417291,26183626498897556176,1336713063706757646465
%N a(n) = (1/n) * Sum_{k=0..n-1} C(n,k) * C(n,k+1) * (n-1)^k.
%C A diagonal of Narayana array (A008550).
%H Vincenzo Librandi, <a href="/A099169/b099169.txt">Table of n, a(n) for n = 1..100</a>
%H Paul Barry and Aoife Hennessy, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL15/Barry2/barry190r.html">Generalized Narayana Polynomials, Riordan Arrays, and Lattice Paths</a>, Journal of Integer Sequences, Vol. 15, 2012, #12.4.8. - From _N. J. A. Sloane_, Oct 08 2012
%F From _Vaclav Kotesovec_, Apr 18 2014, extended Dec 01 2021: (Start)
%F a(n) = Hypergeometric2F1([1-n,-n], [2], -1+n).
%F a(n) ~ exp(2*sqrt(n)-2) * n^(n-7/4) / (2*sqrt(Pi)) * (1 + 119/(48*sqrt(n))). (End)
%p A099169:= n-> add( binomial(n, j)*binomial(n-1,j)*(n-1)^j/(j+1), j=0..n-1);
%p seq( A099169(n), n=1..30) # _G. C. Greubel_, Feb 16 2021
%t Join[{1},Table[Sum[Binomial[n,k]Binomial[n,k+1](n-1)^k,{k,0,n-1}]/n,{n,2,20}]] (* _Harvey P. Dale_, Oct 07 2013 *)
%t Table[Hypergeometric2F1[1-n,-n,2,-1+n],{n,1,20}] (* _Vaclav Kotesovec_, Apr 18 2014 *)
%o (Sage)
%o def A099169(n): return sum( binomial(n, j)*binomial(n-1,j)*(n-1)^j/(j+1) for j in [0..n-1])
%o [A099169(n) for n in [1..30]] # _G. C. Greubel_, Feb 16 2021
%o (Magma)
%o A099169:= func< n | (&+[Binomial(n, j)*Binomial(n-1,j)*(n-1)^j/(j+1): j in [0..n-1]]) >;
%o [A099169(n): n in [1..30]]; // _G. C. Greubel_, Feb 16 2021
%o (PARI) a(n) = (1/n) * sum(k=0, n-1, binomial(n,k) * binomial(n,k+1) * (n-1)^k); \\ _Michel Marcus_, Feb 16 2021
%Y Cf. A092366, A187018, A187019, A187021.
%Y Cf. A008550, A204057, A243631.
%K nonn,easy
%O 1,2
%A _Ralf Stephan_, Oct 09 2004
|
