[seqfan] Re: The Sequencer OEIS survey

Susanne Wienand susanne.wienand at gmail.com
Mon Apr 13 15:44:43 CEST 2015


Hello,

thank you for the survey.
Concerning the conjecture for A027983, it seems that 2^n should be replaced
by 2^(n+1) (the offset of A027983 is 0).

Regards
Susanne

2015-04-13 9:00 GMT+02:00 <hv at crypt.org>:

> Thanks, this looks like nice work: many of the conjectures look very
> credible.
>
> If I correctly understand the sequence definition, the proposed formula
> for A145052 looks very likely, and if correct it should be easy to prove.
>
> However the conjecture for A129254 will match little more than the values
> listed - the pattern will break as soon as we start to reach [neighbours
> of]
> multiples of 5^5, 3124 being the first example.
>
> Hugo
>
> Philipp Emanuel Weidmann <pew at worldwidemann.com> wrote:
> :Back in February I announced a project to scan all OEIS sequences using
> :the Sequencer system (https://github.com/p-e-w/sequencer) in order to
> :identify new closed-form expressions for the sequence terms.
> :
> :The search has now concluded and the results are available at
> :http://worldwidemann.com/the-sequencer-oeis-survey/
> :
> :Please note that only sequences without a "formula" field were scanned
> :as explained in the article.
> :
> :Best regards
> :Philipp Emanuel Weidmann
> :
> :
> :
> :_______________________________________________
> :
> :Seqfan Mailing list - http://list.seqfan.eu/
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>


More information about the SeqFan mailing list