[seqfan] Re: Xmas-challenge

[Peter Luschny]

The lengths from respondents I know so far are 42, 55, and 63.

If you found the max length prove that no longer one is possible!

Then swap 99 for n and start building the sequence:

a(n) is the length of the longest sequence of distinct numbers
between 1 and n such that if k immediately follows m, then
either k divides m or m divides k.

However, if this sequence is already in the OEIS, don't reveal it (this
year).