The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A323769 a(n) = Sum_{k=0..floor(n/2)} binomial(n-k,k)^n. 3
 1, 1, 2, 9, 83, 1268, 62283, 10296321, 2668655428, 1306416217435, 3055324257386077, 17213278350960504924, 137320554100797006975445, 3087543920644806918694851647, 335732238884967561227813578781572, 61125387696211835948801235842204794881 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS The limit a(n) / (5^(n/4) * phi^(n*(n+1)) / (2*Pi*n)^(n/2)) does not exist but oscillates between 2 attractors. The value is dependent on the fractional part of n/(sqrt(5)*phi), see graph. - Vaclav Kotesovec, Jan 28 2019 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..71 Vaclav Kotesovec, Graph - the asymptotic ratio FORMULA a(n)^(1/n) ~ 5^(1/4) * phi^(n+1) / sqrt(2*Pi*n), where phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - Vaclav Kotesovec, Jan 27 2019 log(a(n)) ~ n*(n*v + w - log(n))/2 with v = 2*log((1 + sqrt(5))/2) and w = log((35 + 15*sqrt(5))/(8*Pi^2))/2, preceding formula recast. - Peter Luschny, Jan 28 2019 MATHEMATICA Table[Sum[Binomial[n-k, k]^n, {k, 0, n/2}], {n, 0, 15}] (* Vaclav Kotesovec, Jan 27 2019 *) PROG (PARI) {a(n) = sum(k=0, n\2, binomial(n-k, k)^n)} CROSSREFS Main diagonal of A323767. Cf. A011973, A051286, A181545, A181546, A181547, A209428, A323768. Sequence in context: A067309 A087798 A113146 * A296581 A069234 A086929 Adjacent sequences:  A323766 A323767 A323768 * A323770 A323771 A323772 KEYWORD nonn AUTHOR Seiichi Manyama, Jan 27 2019 STATUS approved

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

Last modified August 3 15:34 EDT 2021. Contains 346439 sequences. (Running on oeis4.)