[seqfan] Re: Partitioning 1..n
Max Alekseyev
maxale at gmail.com
Thu Feb 25 20:09:56 CET 2010
On Thu, Feb 25, 2010 at 9:18 AM, <hv at crypt.org> wrote:
> 1. Let a(n) = min(|prod(A) - prod(B)|) such that A, B partition { 1..n }.
> I calculate the sequence goes like:
> 1..10: 0 1 1 2 2 6 2 18 54 30
> 11..20: 36 576 576 840 6120 24480 20160 93696 420480 800640
> 21..30: 1305696 7983360 80313120 65318400 326592000 2286926400 3002360256 13680979200 37744574400 797369149440
> 31.. : 1763653953600 16753029012720 16880461678080
>
> Can someone confirm these values?
...
> Neither of these sequences is in OEIS. I'll submit them in a few days, along
> with any additional material that arises in the interim.
The first one is http://www.research.att.com/~njas/sequences/A038667
but without a(1)=0
I think it's worth to prepend this term and change the offset to 1.
Max
More information about the SeqFan
mailing list