OEIS conventions

[N. J. A. Sloane]

some m > n?
Return-Path: <israel at math.ubc.ca>
X-Ids: 165
Date: Sun, 20 May 2007 19:02:55 -0700 (PDT)
From: Robert Israel <israel at math.ubc.ca>
To: Leroy Quet <qq-quet at mindspring.com>
cc: seqfan at ext.jussieu.fr
Subject: Re: product k^mu(n+1-k)
In-Reply-To: <E1HppDU-0001vl-00 at pop03.mail.atl.earthlink.net>
Message-ID: <Pine.GSO.4.64.0705201831320.29182 at hilbert.math.ubc.ca>
References: <E1HppDU-0001vl-00 at pop03.mail.atl.earthlink.net>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed
X-Greylist: IP, sender and recipient auto-whitelisted, not delayed by milter-greylist-3.0 (shiva.jussieu.fr [134.157.0.165]); Mon, 21 May 2007 04:02:59 +0200 (CEST)
X-Virus-Scanned: ClamAV 0.88.7/3271/Sun May 20 11:33:27 2007 on shiva.jussieu.fr
X-Virus-Status: Clean
X-Miltered: at shiva.jussieu.fr with ID 4650FDD2.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)!

According to Maple there are no repetitions up to n=25000.
I suspect there are none, though of course this isn't a proof.

Cheers,
Robert Israel

On Sun, 20 May 2007, Leroy Quet 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?
>
> The sequence of rationals tends downwards, it seems, but it is a bumpy
> plot -- so there seems to be plenty of opportunity for the same rational
> to occur two or more times in the sequence.
>
>
> Thanks,
> Leroy Quet
>