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)? -- 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.
