On Thu, Oct 29, 2020 at 11:27 PM Blue diamond <1234blue12345...@gmail.com> wrote:
> An(t) are defined by the following recurrence: A0(t) = 1 An(t) = t(1 − > t)A 0 n−1 (t) + An−1(t)(1 + (n − 1))t for n ≥ 1 > > How would I write this using n eulRec which takes in a number n and uses > ordinary recursion and outputs the nth Eulerian polynomial An(t). Provide > the output for eulRec(4)? > homework? > -- > You received this message because you are subscribed to the Google Groups > "sage-support" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to sage-support+unsubscr...@googlegroups.com. > To view this discussion on the web visit > https://groups.google.com/d/msgid/sage-support/775b82c3-bd8d-498e-a59a-d3de51d4cf10n%40googlegroups.com > <https://groups.google.com/d/msgid/sage-support/775b82c3-bd8d-498e-a59a-d3de51d4cf10n%40googlegroups.com?utm_medium=email&utm_source=footer> > . > -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/CAAWYfq1w%2BpSc2fS9c83VyUfxFOO5P_5%2Brcub-uQNxqN3g1LPuA%40mail.gmail.com.
