Hi,

Thanks for the reply; It was very close to what it is needed, but I have another question.

In that post, first a recursion is found using "listtorec" and then that recursion is solved using "rsolve"

Isn't there any way to generate the sequence from the recursive formula without solving? because solving is not necessary, as long as you have recursive formula and the base cases, sequence can be generated ....

//Mehrdad

Hi,

I am a student from Sweden; Concerning a project about integer sequences, I have a question about Maple and Integer Sequence recognition.

I am trying to find a command in Maple capable of identfying and recognizing integer sequences as appear in IQ tests or any general form of integer sequences. For example, Wolfram Mathematica has a command named "FindSequenceFunction" as descibed here: http://reference.wolfram.com/mathematica/ref/FindSequenceFunction.html