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!)
A358652 a(n) = n!*Sum_{m=1..floor((n+1)/2)} 1/(m*binomial(n-m,m-1)). 0
1, 2, 9, 30, 180, 890, 7084, 47544, 478512, 4103712, 50079744, 525568032, 7531512768, 93697680960, 1539661512960, 22172241784320, 410427317468160, 6717998786595840, 138197449498521600, 2534644598027673600, 57329127350795059200 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
E.g.f.: log(1-x)/x/(1-x)+(-(-1+x)*(1+2*x))*log((1-x)^2*(1+x))/(x*(x^2-x-1)*(1-x))+(li[2](x*((1-x)*x+1))-li[2](x))/(1-x)^2.
MATHEMATICA
a[n_] := n! * Sum[1/(m*(Binomial[n - m, m - 1])), {m, 1, Floor[(n + 1)/2]}]; Array[a, 21] (* Amiram Eldar, Nov 25 2022 *)
PROG
(Maxima)
a(n):=n!*sum(1/(m*(binomial(n-m, m-1))), m, 1, floor((n+1)/2));
(PARI) a(n) = n!*sum(m=1, (n+1)\2, 1/(m*binomial(n-m, m-1))); \\ Michel Marcus, Nov 25 2022
CROSSREFS
Sequence in context: A181954 A343565 A318101 * A347893 A151823 A084652
KEYWORD
nonn
AUTHOR
Vladimir Kruchinin, Nov 25 2022
STATUS
approved

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 September 17 19:13 EDT 2024. Contains 375990 sequences. (Running on oeis4.)