Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112035
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A112035 Sum(k*C(n,k)^2*C(n+k,k)^3,k=0..n), where C := binomial. +0
1
0, 8, 540, 42576, 3675000, 334595040, 31539372732, 3046472028320, 299666635774704, 29894793786770040, 3016010007220052700, 307083034957464057600, 31506217163866419507000, 3253427167078021753747200, 337821983730064508845772700, 35246436592815103238009282880 (list; graph; listen)
OFFSET

0,2

REFERENCES

C. Elsner, On recurrence formulae for sums involving binomial coefficients, Fib. Q., 43 (No. 1, 2005), 31-45.

CROSSREFS

Sequence in context: A003397 A121740 A089671 this_sequence A027536 A058045 A086641

Adjacent sequences: A112032 A112033 A112034 this_sequence A112036 A112037 A112038

KEYWORD

nonn

AUTHOR

njas, Nov 28 2005

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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research