Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127548
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127548 O.g.f.: Sum_{n>=0} n!*(x/(1+x)^2)^n. +0
1
1, 1, 0, 1, 4, 19, 112, 771, 6088, 54213, 537392, 5867925, 69975308, 904788263, 12607819040, 188341689287, 3002539594128, 50878366664393, 913161208490016, 17304836525709097, 345279674107957524 (list; graph; listen)
OFFSET

0,5

FORMULA

a(n)=sum_{s=1..n} (-1)^(n-s)*s!*C(s+n-1,2s-1) if n>=1, where C(a,b)=binomial(a,b). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 13 2007

MAPLE

A127548 := proc(n) if n = 0 then 1 ; else add(factorial(s)*(-1)^(n-s)*binomial(s+n-1, 2*s-1), s=1..n) ; fi ; end: for n from 0 to 20 do printf("%d, ", A127548(n)) ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 13 2007

CROSSREFS

Cf. A000179, A078480.

Sequence in context: A117397 A004212 A060905 this_sequence A122835 A013185 A060907

Adjacent sequences: A127545 A127546 A127547 this_sequence A127549 A127550 A127551

KEYWORD

easy,more,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 27 2007

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 13 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 September 6 09:40 EDT 2008. Contains 143480 sequences.


AT&T Labs Research