Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128433
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A128433
%S A128433 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,
%T A128433 3125,1,1,46656,37500,34560,34560,37500,46656,1,1,823543,5103,590625,35,
%U A128433 590625,5103,823543,1,1,16777216,13176688,1792,11200000,11200000,1792
%N 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.
%C A128433 For n>0: Sum(T(n,k)/A128434(n,k): 0<=k<=n) = A090878(n)/A036505(n-1);
%C A128433 T(n,n-k) = T(n,k); T(n,0) = 1;
%C A128433 for n>0: T(n,1)/A128434(n,1) = A000312(n-1)/A000169(n).
%H A128433 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               BernsteinPolynomial.html">Bernstein Polynomial</a>
%F A128433 T(n,k)/A128434(n,k) = Binomial(n,k) * k^k * (n-k)^(n-k) / n^n.
%Y A128433 Sequence in context: A075613 A155194 A080044 this_sequence A089746 A094884 
               A053216
%Y A128433 Adjacent sequences: A128430 A128431 A128432 this_sequence A128434 A128435 
               A128436
%K A128433 nonn,tabl,frac
%O A128433 0,8
%A A128433 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 03 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research