从级数中求代数generating function的方法
A method for obtaining the algebraic generating function from a series
摘要：
我们在这里描述了一个实验方法，允许计算一个很好的候选人的封闭形式的生成函数，如果我们知道的第一个几项的一系列。该方法是基于整数关系算法，并使用两个程序的符号计算：Maple或Pari-Gp。一些结果载于附录。这个方法在一组序列上进行了测试，这些序列是即将出版的关于整数序列的书（截至1993年）的一部分。这种方法是在FPSAC，正式幂级数和代数组合学，佛罗伦萨，1993年6月。
英文摘要：
We describe here an experimental method that permits to compute a good candidate for the closed form of a generating function if we know the first few terms of a series. The method is based on integer relations algorithms and uses either two programs of symbolic computation: Maple or Pari-Gp. Some results are presented in the appendix. This method was tested on a set of sequences that were part of the incoming book on integer sequences (as of 1993). This method was presented at the FPSAC, Formal Power Series and Algebraic Combinatorics, Florence, June 1993.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
