Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123680
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123680 a(n) = Sum_{k=0..n} C(n+k-1,k)*k!. +0
3
1, 2, 9, 76, 985, 17046, 366289, 9374968, 278095761, 9375293170, 353906211241, 14785127222724, 677150215857193, 33734100501544366, 1816008001717251105, 105048613959883117936, 6497985798745934394529, 427999600108502895779658 (list; graph; listen)
OFFSET

0,2

COMMENT

a(n) is divisible by (n+1) : a(n)/(n+1) = A123681(n).

EXAMPLE

Since a(n) = Sum_{k=0..n} k! * [x^k] 1/(1-x)^n, to get a(4),

list coefficients of x^0 through x^4 in 1/(1-x)^4, [1,4,10,20,35],

then dot product with factorials 0! through 4!, [0!,1!,2!,3!,4! ],

so that a(4) = 1*0! + 4*1! + 10*2! + 20*3! + 35*4! = 985.

PROGRAM

(PARI) a(n)=sum(k=0, n, binomial(n+k-1, k)*k!)

CROSSREFS

Cf. A123681.

Sequence in context: A029849 A080638 A105785 this_sequence A132621 A108992 A058164

Adjacent sequences: A123677 A123678 A123679 this_sequence A123681 A123682 A123683

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 05 2006

EXTENSIONS

Definition corrected Oct 27 2006

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research