Answer:For any integer n, let =lcm(1,2,…,)Ln=lcm(1,2,…,n). Then, the numbers 1,2,…,1Ln,2Ln,…,nLn are an arithmetic progression and are all in the sequence since Lnn is a positive integer. You could also use 1!,2!,…,!1n!,2n!,…,nn!.
Explanation:
The arithmetic progressions you found written in ascending order are:16,26,3616,26,36112,212,312,412112,212,312,412160,260,360,460,560 Let 11,12,…,11a1,1a2,…,1an be a decreasing arithmetic progression of unit fractions of length n. Then you can add a rational number at the front, to make the arithmetic progression 0,11,12,…,1ka0,1a1,1a2,…,1anwith ,0k,a0 being coprime integers. Now divide all of them by k, and you have a new arithmetic progression of unit fractions of length +1n+1. This you can keep going indefinitely.You are, of course, free to divide by any multiple of k, but apart from that everything is forced, and given two fractions to start, whatever result you get will be similar (in the geometric sense) to what you get by dividing with exactly k. So essentially, the sequences you end up with are entirely decided by what two fractions you start with.