Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087301
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087301 a(n) = n!*Sum_{i=1..n-1} (-1)^(i+1)/i. +0
2
2, 3, 20, 70, 564, 3108, 30624, 230256, 2705760, 25771680, 352805760, 4067556480, 63651813120, 861371884800, 15176802816000, 235775183616000, 4620563523072000, 81032645804544000, 1748700390205440000 (list; graph; listen)
OFFSET

2,1

COMMENT

Stirling transform of A052882(n)=[0,2,9,52,375,...] is a(n+1)=[0,2,3,20,...]. - Michael Somos Mar 04 2004

FORMULA

E.g.f.: x*ln(1+x)/(1-x). a(n) = 1/2*(-1)^n*n!*(2*(-1)^n*ln(2)+Psi(1/2+1/2*n)-Psi(1/2*n)).

PROGRAM

(PARI) a(n)=if(n<0, 0, n!*polcoeff(log(1+x+x*O(x^n))*x/(1-x), n))

CROSSREFS

Cf. A024167, A052881.

Sequence in context: A072472 A055814 A041567 this_sequence A007113 A066166 A052804

Adjacent sequences: A087298 A087299 A087300 this_sequence A087302 A087303 A087304

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Oct 20 2003

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 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research