This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A128433 Triangle read by rows, 0<=k<=n: T(n,k) = numerator of the maximum of the k-th Bernstein polynomial of degree n; denominator is A128434. 10
 1, 1, 1, 1, 1, 1, 1, 4, 4, 1, 1, 27, 3, 27, 1, 1, 256, 216, 216, 256, 1, 1, 3125, 80, 5, 80, 3125, 1, 1, 46656, 37500, 34560, 34560, 37500, 46656, 1, 1, 823543, 5103, 590625, 35, 590625, 5103, 823543, 1, 1, 16777216, 13176688, 1792, 11200000, 11200000, 1792 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 COMMENTS For n>0: Sum(T(n,k)/A128434(n,k): 0<=k<=n) = A090878(n)/A036505(n-1); T(n,n-k) = T(n,k); T(n,0) = 1; for n>0: T(n,1)/A128434(n,1) = A000312(n-1)/A000169(n). LINKS Eric Weisstein's World of Mathematics, Bernstein Polynomial FORMULA T(n,k)/A128434(n,k) = Binomial(n,k) * k^k * (n-k)^(n-k) / n^n. CROSSREFS Sequence in context: A189150 A155194 A080044 * A089746 A225330 A094884 Adjacent sequences:  A128430 A128431 A128432 * A128434 A128435 A128436 KEYWORD nonn,tabl,frac AUTHOR Reinhard Zumkeller, Mar 03 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 14:12 EST 2019. Contains 319225 sequences. (Running on oeis4.)