login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129326 a(n) = (2*n+1)*(n-1)!. 9
3, 5, 14, 54, 264, 1560, 10800, 85680, 766080, 7620480, 83462400, 997920000, 12933043200, 180583603200, 2702527027200, 43153254144000, 732297646080000, 13160434839552000, 249692574523392000, 4987449116762112000, 104614786351595520000, 2299092397726924800000 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a(n)=A052649(n), n>=1 (i.e., A052649 with a(0) omitted).

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..100

FORMULA

a(n)=A052649(n), n>=1. - R. J. Mathar, Jun 14 2008

a(n)=(n+1)!*h(n+1)-n*(n+1)*(n-1)!*h(n-1), where h(n)=sum(1/k,k=1..n). [From Gary Detlefs, Jul 19 2011]

PROG

(MAGMA) [(2*n+1)*Factorial(n-1): n in [1..25]]; // Vincenzo Librandi, Aug 07 2011

CROSSREFS

Sequence in context: A006395 A078718 A081393 * A167553 A118562 A115043

Adjacent sequences:  A129323 A129324 A129325 * A129327 A129328 A129329

KEYWORD

nonn,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), May 26 2007

EXTENSIONS

More terms from N. J. A. Sloane (njas(AT)research.att.com), Nov 08 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 02:30 EST 2012. Contains 205860 sequences.