Last Update: April 14, 2008.
Feel free to propose your own project!
The suggestions below are very brief. Feel free to ask me more. Once you pick a project, I'll tell you more about it.
a(n,t):=number of lists [v1,v2, ..., vt],
such that for each i, the partial sums
v1+v2+ ... +vi
are never 0, and
v1+v2+ ... +vt=n.
In particular, what can you say about
the enumerating sequence of all t-step self-avoiding walks,
i.e.
A(t):= Σt*min(S) ≤ n ≤t*max(S) n
a(n,t)