Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092868
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092868 Coefficients c[r,n] in Schmidt's problem Sum[Binomial[n,k]^r Binomial[n+k,k]^r,{k,0,n}] == Sum[Binomial[n,k]Binomial[n+k,k]c[r,k],{k,0,n}] for r=4. +0
2
1, 8, 424, 48896, 6672232, 1022309408, 176808084544, 33055112886272, 6507475475389288, 1336577286762538496, 284198765977135568224, 62135041920796512325952, 13901968841738902540019776 (list; graph; listen)
OFFSET

0,2

LINKS

Eric Weisstein's World of Mathematics, Schmidt's Problem

MATHEMATICA

c[4, n_] := Sum[Binomial[2j, j]^3Binomial[n, j]Binomial[k+j, k-j]Binomial[j, n-k]Binomial[k, j]Binomial[2j, k-j], {k, 0, n}, {j, 0, n}]

CROSSREFS

Cf. A000172, A000658.

Fourth row of array A094424.

Adjacent sequences: A092865 A092866 A092867 this_sequence A092869 A092870 A092871

Sequence in context: A015091 A008274 A038781 this_sequence A038782 A024110 A132099

KEYWORD

nonn

AUTHOR

Eric Weisstein (eric(AT)weisstein.com), Mar 08, 2004

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 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research