Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158886
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158886 a(n) = (n+1)^n * n! * C(1/(n+1), n). +0
1
1, 1, -2, 21, -504, 21505, -1432080, 137227545, -17893715840, 3047775608241, -657209398809600, 175036741783305325, -56436686113876992000, 21667473499647065000625, -9768377272589156352395264 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = Product_{k=0..n-1} (1 - k*(n+1)) for n>0 with a(0)=1.

a(n) = Coefficient of x^n/(n!*(n+1)^n) in (1+x)^(1/(n+1)).

EXAMPLE

a(1) = 1, a(2) = 1*(-2), a(3) = 1*(-3)*(-7), a(4) = 1*(-4)*(-9)*(-14).

PROGRAM

(PARI) a(n)=(n+1)^n*n!*binomial(1/(n+1), n)

(PARI) a(n)=if(n==0, 1, prod(k=0, n-1, 1-k*(n+1)))

CROSSREFS

Cf. A158887.

Sequence in context: A090310 A024232 A090451 this_sequence A092957 A078602 A060319

Adjacent sequences: A158883 A158884 A158885 this_sequence A158887 A158888 A158889

KEYWORD

sign

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), May 01 2009

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 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research