Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Asymptotic behavior of functions, asymptotic series and related topics
14
votes
1
answer
696
views
Are the asymptotics of A003238 known?
log(a(n))$ is asymptotic to $c \log(n)^2$ where $0.4 < c < 0.5$ (Benoit Cloitre, Apr 13 2004)
What I'm interested in is both the state of this conjecture, and more generally, methods for analysing the asymptotics … of sequences defined by ``similar'' recurrences - either globally (as above) or in the average sense i.e. asymptotics of things like $(1/n)\sum_{i=1}^n a(n)$. …
7
votes
1
answer
455
views
More asymptotics for trees
This is a follow up to my recent question on the asymptotics of A003238. … So, what are the asymptotics of $S$? …
3
votes
More asymptotics for trees
I'd like to promote Lucia's comment to an answer if I could but apparently I can't. I'll just fill in a few of the details. The basic idea is to pretend that $S(x) = C x^{\alpha}$. Plug in to the recu …