[seqfan] Re: Need proof that Kimberling's A26185 = A198173
njasloane at gmail.com
Sat Feb 1 21:05:47 CET 2020
Antti: Good point. I agree.
On Sat, Feb 1, 2020 at 2:58 PM Antti Karttunen <antti.karttunen at gmail.com>
> On 2/1/20, Neil Sloane <njasloane at gmail.com> wrote:
> > Dear Seq Fans, Michel Dekking (<a
> > href="https://arxiv.org/abs/2001.08915">Permutations
> > of N generated by left-right filling algorithms</a>, arXiv:2001.08915
> > [math.CO], 2020) recently showed that many of Clark's sequences which
> > appeared to be duplicates really were duplicates.
> Wouldn't be it more fair to say that the sequences with higher
> A-numbers are duplicates of those with lower A-numbers? Unless of
> course the earlier sequences were submitted with erroneous (or
> missing) terms, avoiding thus change for the later submitters to
> realize that their sequences are already in the database.
> Best regards,
> > I have now processed all these pairs or triples or even quadruples of
> > identical-valued sequences and declared a dozen or more of these entries
> > to be duplicates with keyword "dead".
> > But one of these triples has a loose end. A026209 = A026185 is true,
> > but A026185 =? A198473 is an open question. The latter has a simple
> > definition:
> > If n even, then 2n. If n odd, then nearest integer to 2n/3.
> > but A026185 is not so easy to describe.
> > Could someone find a proof? Then we can merge the entries and declare
> > more sequence to be "dead".
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan