Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109573
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109573 E.g.f.: 2x/[1+exp(-2x)]. +0
1
0, 1, 2, 0, -8, 0, 96, 0, -2176, 0, 79360, 0, -4245504, 0, 313155584, 0, -30460116992, 0, 3777576173568, 0, -581777702256640, 0, 108932957168730112, 0, -24370173276164456448, 0, 6419958484945407574016, 0, -1967044844910430876860416, 0, 693575525634287935244206080, 0 (list; graph; listen)
OFFSET

0,3

COMMENT

"Bernoulli numbers" for 2x/[1+exp(-2x)].

FORMULA

a(0) = 0 and for n > 0 a(n) = n 2^(n-1) E_{n-1}(1) where E_{m}(x) are the Euler polynomials. [From Peter Luschny (peter(AT)luschny.de), Jan 26 2009]

MAPLE

G:=2*x/(1+exp(-2*x)): Gser:=series(G, x=0, 35): 0, seq(n!*coeff(Gser, x^n), n=1..32); # yields the signed sequence

A109573 := n -> `if`(n = 0, 0, n*2^(n-1)*euler(n-1, 1)): [From Peter Luschny (peter(AT)luschny.de), Jan 26 2009]

MATHEMATICA

g[x_] = x/(-1 + Sum[(-2)^(n - 1)*x^n/n!, {n, 1, Infinity}]) h[x_, n_] = Dt[g[x], {x, n}] a[x_] = Table[h[x, n], {n, 0, 50}]; b = Abs[a[0]]

X[m_] := m Sum[(-2)^(m-1-k) k! StirlingS2[m-1, k], {k, 0, m-1}]; Table[X[i], {i, 0, 20}] [From Peter Luschny (peter(AT)luschny.de), Apr 29 2009]

CROSSREFS

Sequence in context: A167029 A094030 A103424 this_sequence A159810 A146543 A021052

Adjacent sequences: A109570 A109571 A109572 this_sequence A109574 A109575 A109576

KEYWORD

sign

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 27 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research