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!)
A367256 a(n) = Sum_{k=0..n} binomial(n, k) * binomial(n - 1, k - 1) * n^(n - k). 2

%I #15 Jan 31 2024 08:07:10

%S 1,1,5,46,593,9726,192637,4457580,117769409,3492894070,114790042901,

%T 4137157889316,162154385331985,6863637142316332,311905306734621069,

%U 15140756439172826776,781693659313991730945,42759819036520142319270,2469943332976774829606821

%N a(n) = Sum_{k=0..n} binomial(n, k) * binomial(n - 1, k - 1) * n^(n - k).

%H Paolo Xausa, <a href="/A367256/b367256.txt">Table of n, a(n) for n = 0..350</a>

%F a(n) = Sum_{k=0..n} A367267(n, k) * n^(n - k).

%F a(n) = n*n^(n - 1)*hypergeom([1 - n, 1 - n], [2], 1/n) for n > 0.

%F a(n) ~ exp(2*sqrt(n) - 1) * n^(n - 3/4) / (2*sqrt(Pi)). - _Vaclav Kotesovec_, Nov 11 2023

%p a := n -> if n= 0 then 1 else n*n^(n - 1)*hypergeom([1 - n, 1 - n], [2], 1/n) fi:

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

%t A367256[n_] := If[n == 0, 1, n*n^(n-1)*Hypergeometric2F1[1-n, 1-n, 2, 1/n]];

%t Array[A367256, 25, 0] (* _Paolo Xausa_, Jan 31 2024 *)

%Y Cf. A187021, A367267, A367257.

%K nonn

%O 0,3

%A _Peter Luschny_, Nov 11 2023

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 August 29 22:07 EDT 2024. Contains 375518 sequences. (Running on oeis4.)