# [seqfan] Re: Seeking Board's advice again re EULA -- key points of the OEISF Bylaws, Articles & Goals

Ron Hardin rhhardin at att.net
Sat Feb 12 12:57:01 CET 2011

```Stuff like partitions with no (some criterion involving large numbers) will
match smaller partitions for many terms, in fact to the point that you can't

Mild forms of that interfere with the conjecture, in a sort of non-independence
effect.

As the formula matches, it increases the baysean odds of both being correct and
of being one of these large number criterion series, so the ratio doesn't fall.

rhhardin at mindspring.com
rhhardin at att.net (either)

----- Original Message ----
> From: Simon Plouffe <simon.plouffe at gmail.com>
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Cc: dsj at research.att.com; graham at ucsd.edu; BRUGGED at aol.com; N. J. A. Sloane
><njas at research.att.com>
> Sent: Sat, February 12, 2011 1:15:39 AM
> Subject: [seqfan] Re: Seeking Board's advice again re EULA -- key points of the
>OEISF Bylaws, Articles & Goals
>
> Hello,
>
>  I am compiling a new set of formulas that
> are automatically  generated from my set of
> programs and I have 1 idea that could be  useful.
>
>  There is a way to get a measure of the validity of
> a  conjectural formula, there are 3 pieces of information
> we can use :
>
> 1)  The number of known terms in the sequence.
> 2) The length in characters of the  sequence.
> 3) The length of the supposed formula.
>
> measure = log(number  of terms)*length(sequence)/length(formula).
>
> This gives a number from 0 to  ...
>  a value of < 4 is usualy suspect.
> a value of 20 or more says that  given the number of terms,
> the length of the formula, this result can be  considered quite good,

```