# [seqfan] Re: Finite sequence?

jnthn stdhr jstdhr at gmail.com
Tue Sep 19 16:15:50 CEST 2017

```Hans,

Thank you for pointing out the multiple pairs.  Later today I will modify
my program to check for multiple pairs and report.

Also, thank you for the Mathematica test.  I have coded an algorithm using
Python (for its built-in big num capabilities) that produces the full
triangle A008284(10,000) in about 3 minutes.  As a test of correctness I
totaled row 10,000 and compared the result to the value of P(10,000) shown
on the Wikipedia page for partitions and its begining and ending parts
match.  I assume my method is novel, but who knows.  Any suggestions for
how I should go about making this algorithm known?  Although it's rather
simple, it's in a quick-and-dirty state and needs refinement, but I am
willing to post it here for review.

-Jonathan
On Sep 19, 2017 5:49 AM, "Hans Havermann" <gladhobo at bell.net> wrote:

> > For the values of m=8,13,19,26,34,43,46,68, none of which is equal to
> 2P(n) or 2P(n)+1 for some integer n, there are repeated values greater than
> 1 in T_m:
>
> Note that for m = 11, 14, and 60, there are two pairs of repeated values.
> Perhaps only one of these pairs meets your 2P/2P+1 exclusion principle?
>
> > As an aside, would some mind timing how long it takes Mathematica to
> produce the triangle A008284(10,000)?
>
> Blindly using the second (of three) Mathematica formulation in A008284,
> I'd guess (based on a half-day run) that it would take me about three days.
>
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>
```