[seqfan] bounds and asymptotics for A033485

[Georgi Guninski]

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)