[seqfan] Re: The Sequencer OEIS survey
John W. Nicholson
reddwarf2956 at yahoo.com
Mon Apr 13 19:47:10 CEST 2015
Related to A027983 is A027960. Why is there not a keyword table in A027960? John W. Nicholson
On Monday, April 13, 2015 10:11 AM, Susanne Wienand <susanne.wienand at gmail.com> wrote:
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).
2015-04-13 9:00 GMT+02:00 <hv at crypt.org>:
> Thanks, this looks like nice work: many of the conjectures look very
> 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
> multiples of 5^5, 3124 being the first example.
> 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
> :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/
Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan