In a previous post I discussed a method for computing polynomials for sequences. I finished the previous post by posing the question of what makes an unambiguous sequence question.

As promised, I’ve attached a PDF Article, that provides rigorous justification for the methods in the previous post.

After reading the attached PDF you may have ideas on how to make a sequence question unambiguous.

I haven’t written out a proof to convince myself but I believe specifying the smallest degree polynomial which generates the sequence is enough to make it unambiguous. If any one has any other thoughts please feel free to comment.