[seqfan] Re: bounds and asymptotics for A033485

[Rob Pratt]

https://mathoverflow.net/questions/401272/bounds-for-an-an-1a-lfloor-n-2-rfloor

On Tue, Aug 10, 2021 at 2:10 PM jean-paul allouche <
jean-paul.allouche at imj-prg.fr> wrote:

> Looking at A033485, I observed and it is easy
> to prove that A033485(2n-1) = A131205(n).
> If I am not mistaken this is not written in any of the two
> sequences, though the latter indicates the former in the crossrefs.
>
> best
> jp
>
> Le 10/08/2021 à 14:00, Georgi Guninski a écrit :
> > This is related to a problem in graph theory.
> >
> > What are bounds and asymptotics for A033485
> > a(n) = a(n-1) + a(floor(n/2)), a(1) = 1?
> >
> > For m=10^3 we have a(m) < m^4.
> >
> > Can we get log(a(n))=o(log(n)^2)? (small Oh)
> >
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
>
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>