Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119390
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119390 a(n) = n!*Sum_{k=0..n} (-1)^(n-k)*Stirling1(n,k)/k!. +0
1
1, 1, 3, 22, 301, 6631, 214681, 9600088, 566959457, 42745927717, 4006577981071, 457002288429666, 62332395019232053, 10018273615964100787, 1873929413170092413773, 403602063302844878730196, 99165966659478338987124481, 27570715036265111940880945673, 8611670013649050886554308425147, 3002629280961610435928764405429774, 1161987842547239267511188646916322781 (list; graph; listen)
OFFSET

0,3

FORMULA

Sum_{n>=0} a(n)*x^n/n!^2 = BesselJ(0,2*sqrt(ln(1-x))).

MATHEMATICA

Table[n!*Sum[(-1)^(n - k)*StirlingS1[n, k]/k!, {k, 0, n}], {n, 0, 20}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Nov 23 2007

CROSSREFS

Cf. A001569.

Sequence in context: A135862 A122778 A108991 this_sequence A124567 A102223 A046947

Adjacent sequences: A119387 A119388 A119389 this_sequence A119391 A119392 A119393

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Jul 25 2006

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Nov 23 2007

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 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research