[go: up one dir, main page]

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!)
Revision History for A009305 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A009305 Expansion of e.g.f. log(1 + x*cosh(x)).
(history; published version)
#31 by Joerg Arndt at Sat Jan 27 06:29:26 EST 2018
STATUS

proposed

approved

#30 by Michel Marcus at Sat Jan 27 03:54:40 EST 2018
STATUS

editing

proposed

Discussion
Sat Jan 27 04:01
Jon E. Schoenfield: @Michel -- thanks very much for reformatting the Formula entry per the OEIS Style Sheet.  I'm afraid that I often find this contributor's Formula entries so complex that I hesitate to attempt to reformat that them to agree with the Style Sheet because I'm afraid I'm going to get them wrong.  :-(
04:02
Jon E. Schoenfield: (This particular one wasn't bad, but I've gotten into the habit of leaving this contributor's Formula entries alone.)
#29 by Michel Marcus at Sat Jan 27 03:54:35 EST 2018
NAME

EExpansion of e.g.f. log(1 + x*cosh(x)).

FORMULA

a(n) = n!*Sum_{k=1..n-1} ((Sum_{i=0..k} (k-2*i)^(n-k)*binomial(k,i)) /(2^k*(n-k)!)*(-1)^(k-1)/k) + (-1)^(n-1)*(n-1)!. - _Vladimir Kruchinin_, Apr 21 2011

Sum_{k=1..n-1} ((Sum_{i=0..k} (k-2*i)^(n-k)*binomial(k,i))

/(2^k*(n-k)!)*(-1)^(k-1)/k) + (-1)^(n-1)*(n-1)!. - Vladimir Kruchinin, Apr 21 2011

STATUS

proposed

editing

#28 by Jon E. Schoenfield at Sat Jan 27 03:48:15 EST 2018
STATUS

editing

proposed

#27 by Jon E. Schoenfield at Sat Jan 27 03:48:11 EST 2018
NAME

E.g.f. log(1+ + x*cosh(x)).

PROG

a(n):=n!*sum(sum((k-2*i)^(n-k)*binomial(k, i), i, 0, k)/(2^k*(n-k)!)*(-1)^(k-1)/k, k, 1, n-1)+(-1)^(n-1)*(n-1)!; [From _)!; /* _Vladimir Kruchinin_, Apr 21 2011] */

STATUS

approved

editing

#26 by N. J. A. Sloane at Sun Mar 19 00:58:11 EDT 2017
STATUS

proposed

approved

#25 by Jon E. Schoenfield at Sat Mar 18 21:14:59 EDT 2017
STATUS

editing

proposed

#24 by Jon E. Schoenfield at Sat Mar 18 21:14:47 EDT 2017
FORMULA

a(n) = n!*

a(n)=n!*sum(Sum_{k=1..n-1, sum(} ((Sum_{i=0..k, (} (k-2*i)^(n-k)*binomial(k,i))/(2^k*(n-k)!)*(-1)^(k-1)/k)+(-1)^(n-1)*(n-1)!. - _Vladimir Kruchinin_, Apr 21 2011))

/(2^k*(n-k)!)*(-1)^(k-1)/k) + (-1)^(n-1)*(n-1)!. - Vladimir Kruchinin, Apr 21 2011

EXTENSIONS

Extended with signs Mar 15 1997 by __ _Olivier Gérard__._, Mar 15 1997

Definition corrected by Joerg Arndt, Apr 21 2011.

STATUS

approved

editing

#23 by Charles R Greathouse IV at Mon Apr 25 11:45:27 EDT 2016
PROG

(PariPARI) x='x+O('x^66); /* that many terms */

Discussion
Mon Apr 25 11:45
OEIS Server: https://oeis.org/edit/global/2503
#22 by Vaclav Kotesovec at Sat Jan 24 11:11:59 EST 2015
STATUS

editing

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 August 29 23:34 EDT 2024. Contains 375520 sequences. (Running on oeis4.)