Finding generating functions of series

[Dror Speiser]

Are there any implementations of algorithms for finding generating
functions of series?

I mean in the approximating sense, where the algorithm is given n
numbers, and it tries to find a function that its generating
function's first n coefficients are as the given numbers.
Maple has such a package called gfun, written by Bruno Salvy, Paul
Zimmermann and Eithne Murray.

[Mike Hansen]

Hello,

Currently Sage does not have anything in this respect. There is a
Sage workshop in Los Angeles next week with a theme of combinatorics
and graph theory. This is one topic that would be good to work on.
I've added it to the coding sprints page:
http://wiki.sagemath.org/days7/sprints

If you have an internet connection and the elements in your sequence
are integers, you can use Sloane's database from within sage using the
command sloane_find.

sage: sloane_find([i^2 for i in range(1, 20)])
Searching Sloane's online database...
[[290,
'The squares: a(n) = n^2.',
[0,
1,
4,
...

--Mike

[David Joyner]

The Fricas/Axiom package GUESS might do what you want. Some
parts of it are described in http://wiki.sagemath.org/Axiom_as_an_OSCAS
To install it, type
sage -i fricas-0.3.1