product k^mu(n+1-k)

[Max Alekseyev]

On 5/20/07, Leroy Quet <qq-quet at mindspring.com> wrote:
> Let {a(k)} be the sequence of positive rationals where a(n) = product{k=1
> to n} k^mu(n+1-k), where mu(k) is the Mobius (Moebius) function.
>
> (a(n) = A130088(n)/A130089(n).)
>
> Just wondering... What is the smallest value of n where a(n) = a(m) for
> some m > n?

Even existence of such n is a tough question.

btw, for a similar sequence
b(n) = product{k=1 to n} k^mu(k) = A130086(n) / A130087(n)
I can prove that there is no such n (i.e., all b(n) are distinct).

Max