Are these numbers known?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
5
down vote

favorite












Are the numbers appearing as coefficients in the following sequence of polynomials known? Is there a known recurrence relation to compute them?



beginalign*
(x+y) &= x+y \
(x+y)(x+2y) &= x^2+3yx+2y^2 \
(x+y)(x+2y)(x+3y) &= x^3+6yx^2+11y^2x+6y^3 \
(x+y)(x+2y)(x+3y)(x+4y) &= x^4+10yx^3+35y^2x^2+50y^3x+24y^4 \
&textetc.
endalign*










share|cite|improve this question

















  • 3




    Looks like en.wikipedia.org/wiki/Stirling_numbers_of_the_first_kind, see also oeis.org/A094638.
    – Martin R
    1 hour ago















up vote
5
down vote

favorite












Are the numbers appearing as coefficients in the following sequence of polynomials known? Is there a known recurrence relation to compute them?



beginalign*
(x+y) &= x+y \
(x+y)(x+2y) &= x^2+3yx+2y^2 \
(x+y)(x+2y)(x+3y) &= x^3+6yx^2+11y^2x+6y^3 \
(x+y)(x+2y)(x+3y)(x+4y) &= x^4+10yx^3+35y^2x^2+50y^3x+24y^4 \
&textetc.
endalign*










share|cite|improve this question

















  • 3




    Looks like en.wikipedia.org/wiki/Stirling_numbers_of_the_first_kind, see also oeis.org/A094638.
    – Martin R
    1 hour ago













up vote
5
down vote

favorite









up vote
5
down vote

favorite











Are the numbers appearing as coefficients in the following sequence of polynomials known? Is there a known recurrence relation to compute them?



beginalign*
(x+y) &= x+y \
(x+y)(x+2y) &= x^2+3yx+2y^2 \
(x+y)(x+2y)(x+3y) &= x^3+6yx^2+11y^2x+6y^3 \
(x+y)(x+2y)(x+3y)(x+4y) &= x^4+10yx^3+35y^2x^2+50y^3x+24y^4 \
&textetc.
endalign*










share|cite|improve this question













Are the numbers appearing as coefficients in the following sequence of polynomials known? Is there a known recurrence relation to compute them?



beginalign*
(x+y) &= x+y \
(x+y)(x+2y) &= x^2+3yx+2y^2 \
(x+y)(x+2y)(x+3y) &= x^3+6yx^2+11y^2x+6y^3 \
(x+y)(x+2y)(x+3y)(x+4y) &= x^4+10yx^3+35y^2x^2+50y^3x+24y^4 \
&textetc.
endalign*







algebra-precalculus






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked 1 hour ago









Zen

3114




3114







  • 3




    Looks like en.wikipedia.org/wiki/Stirling_numbers_of_the_first_kind, see also oeis.org/A094638.
    – Martin R
    1 hour ago













  • 3




    Looks like en.wikipedia.org/wiki/Stirling_numbers_of_the_first_kind, see also oeis.org/A094638.
    – Martin R
    1 hour ago








3




3




Looks like en.wikipedia.org/wiki/Stirling_numbers_of_the_first_kind, see also oeis.org/A094638.
– Martin R
1 hour ago





Looks like en.wikipedia.org/wiki/Stirling_numbers_of_the_first_kind, see also oeis.org/A094638.
– Martin R
1 hour ago











1 Answer
1






active

oldest

votes

















up vote
6
down vote













That are the Unsigned Stirling numbers of the first kind $ n brack k $, which are defined as the coefficients in
the expansion
$$ tag*
x(x+1)(x+2) cdots (x+n-1) = sum_k=0^n n brack k x^k
$$



They satisfy the recurrence relation
$$
n+1 brack k = n n brack k + n brack k-1
$$

for $k > 0$, with the initial conditions
$$
 0 brack 0 = 1 , , quad  n brack 0 =  0 brack n = 0
$$

for $n > 0$.



$(*)$ with $n+1$ instead of $n$ and $frac xy$ instead of $x$
leads to
$$
(x+y)(x+2y) cdots (x+ny) = sum_k=0^n n+1 brack k+1 x^k y^n-k
$$






share|cite|improve this answer






















    Your Answer





    StackExchange.ifUsing("editor", function ()
    return StackExchange.using("mathjaxEditing", function ()
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    );
    );
    , "mathjax-editing");

    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "69"
    ;
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function()
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled)
    StackExchange.using("snippets", function()
    createEditor();
    );

    else
    createEditor();

    );

    function createEditor()
    StackExchange.prepareEditor(
    heartbeatType: 'answer',
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader:
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    ,
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );













     

    draft saved


    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2988624%2fare-these-numbers-known%23new-answer', 'question_page');

    );

    Post as a guest






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    6
    down vote













    That are the Unsigned Stirling numbers of the first kind $ n brack k $, which are defined as the coefficients in
    the expansion
    $$ tag*
    x(x+1)(x+2) cdots (x+n-1) = sum_k=0^n n brack k x^k
    $$



    They satisfy the recurrence relation
    $$
    n+1 brack k = n n brack k + n brack k-1
    $$

    for $k > 0$, with the initial conditions
    $$
     0 brack 0 = 1 , , quad  n brack 0 =  0 brack n = 0
    $$

    for $n > 0$.



    $(*)$ with $n+1$ instead of $n$ and $frac xy$ instead of $x$
    leads to
    $$
    (x+y)(x+2y) cdots (x+ny) = sum_k=0^n n+1 brack k+1 x^k y^n-k
    $$






    share|cite|improve this answer


























      up vote
      6
      down vote













      That are the Unsigned Stirling numbers of the first kind $ n brack k $, which are defined as the coefficients in
      the expansion
      $$ tag*
      x(x+1)(x+2) cdots (x+n-1) = sum_k=0^n n brack k x^k
      $$



      They satisfy the recurrence relation
      $$
      n+1 brack k = n n brack k + n brack k-1
      $$

      for $k > 0$, with the initial conditions
      $$
       0 brack 0 = 1 , , quad  n brack 0 =  0 brack n = 0
      $$

      for $n > 0$.



      $(*)$ with $n+1$ instead of $n$ and $frac xy$ instead of $x$
      leads to
      $$
      (x+y)(x+2y) cdots (x+ny) = sum_k=0^n n+1 brack k+1 x^k y^n-k
      $$






      share|cite|improve this answer
























        up vote
        6
        down vote










        up vote
        6
        down vote









        That are the Unsigned Stirling numbers of the first kind $ n brack k $, which are defined as the coefficients in
        the expansion
        $$ tag*
        x(x+1)(x+2) cdots (x+n-1) = sum_k=0^n n brack k x^k
        $$



        They satisfy the recurrence relation
        $$
        n+1 brack k = n n brack k + n brack k-1
        $$

        for $k > 0$, with the initial conditions
        $$
         0 brack 0 = 1 , , quad  n brack 0 =  0 brack n = 0
        $$

        for $n > 0$.



        $(*)$ with $n+1$ instead of $n$ and $frac xy$ instead of $x$
        leads to
        $$
        (x+y)(x+2y) cdots (x+ny) = sum_k=0^n n+1 brack k+1 x^k y^n-k
        $$






        share|cite|improve this answer














        That are the Unsigned Stirling numbers of the first kind $ n brack k $, which are defined as the coefficients in
        the expansion
        $$ tag*
        x(x+1)(x+2) cdots (x+n-1) = sum_k=0^n n brack k x^k
        $$



        They satisfy the recurrence relation
        $$
        n+1 brack k = n n brack k + n brack k-1
        $$

        for $k > 0$, with the initial conditions
        $$
         0 brack 0 = 1 , , quad  n brack 0 =  0 brack n = 0
        $$

        for $n > 0$.



        $(*)$ with $n+1$ instead of $n$ and $frac xy$ instead of $x$
        leads to
        $$
        (x+y)(x+2y) cdots (x+ny) = sum_k=0^n n+1 brack k+1 x^k y^n-k
        $$







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited 42 mins ago

























        answered 1 hour ago









        Martin R

        25.2k32844




        25.2k32844



























             

            draft saved


            draft discarded















































             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2988624%2fare-these-numbers-known%23new-answer', 'question_page');

            );

            Post as a guest













































































            Comments

            Popular posts from this blog

            What does second last employer means? [closed]

            Installing NextGIS Connect into QGIS 3?

            One-line joke