Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000497
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000497 S2(j,2j+2) where S2(n,k) is a 2-associated Stirling number of the second kind.
(Formerly M5186 N2254)
+0
2
1, 25, 490, 9450, 190575, 4099095, 94594500, 2343240900, 62199262125, 1764494857125, 53338158823950, 1712934942468750, 58274046742786875, 2094379201311271875, 79318164037837725000, 3157886388887074845000 (list; graph; listen)
OFFSET

1,2

REFERENCES

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 256.

F. N. David and D. E. Barton, Combinatorial Chance. Hafner, NY, 1962, p. 296.

M. Ward, The representations of Stirling's numbers and Stirling's polynomials as sums of factorials, Amer. J. Math., 56 (1934), 87-95.

MAPLE

gf := (u, t)->exp(u*(exp(t)-1-t)); S2a := j->simplify(subs(u=0, t=0, diff(gf(u, t), u$j, t$(2*j+2)))/j!); for i from 1 to 20 do S2a(i); od;

CROSSREFS

Cf. A008299, A000504.

Sequence in context: A014927 A059946 A118445 this_sequence A028341 A122140 A083191

Adjacent sequences: A000494 A000495 A000496 this_sequence A000498 A000499 A000500

KEYWORD

nonn,nice,easy

AUTHOR

njas

EXTENSIONS

More terms, Maple program from Barbara Haas Margolius (margolius(AT)math.csuohio.edu), Dec 12, 2000.

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research