Re: [sage-support] Eulerian polynomials

2020-10-29 Thread Dima Pasechnik
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 re

[sage-support] Eulerian polynomials

2020-10-29 Thread Blue diamond
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)?