Question: "Identify" for sequences of numbers?

While practicing with the "identify" command, I came across the question:

Does Maple offer a way to determine the generating rule for a sequence of numbers given by a finite initial segment?

Here is a riddle for this:

The sequences {s_n} = 1/1; 1/2; 1/3; ... and {t_n} = 0/1; 1/2; 2/3; 3/4; ... have the formation rules

s_n = 1/n and t_n = (n-1)/n.
What is the formation rule for the sequence {u_n} = {s_n; t_n} formed by alternating between the two?
Note: The solution is not u_2n = t_n and u_(2n−1) = s_n. Rather, the goal is to find a single, unified formation rule u_n that yields the terms of the combined sequence for n = 1; 2; 3; ...

How would one go about querying AI in Maple?

Please Wait...