Timeline for On a A057985 without recursion
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 15 at 12:19 | history | edited | Notamathematician | CC BY-SA 4.0 |
added 26 characters in body; added 5 characters in body
|
| Apr 15 at 11:00 | history | edited | Notamathematician | CC BY-SA 4.0 |
deleted 142 characters in body; added 1 character in body; added 1 character in body
|
| Apr 15 at 5:36 | history | edited | Notamathematician | CC BY-SA 4.0 |
added 667 characters in body
|
| Apr 14 at 16:30 | history | edited | Notamathematician | CC BY-SA 4.0 |
deleted 37 characters in body
|
| Apr 14 at 15:23 | comment | added | Max Alekseyev | Btw, $\mathrm{wt}(A+1)-\mathrm{wt}(A)=1-\mathrm{tr}(A+1)$, which is a bit simpler. Also, $\mathrm{tr}(n)=\nu_2(n)$ is a more traditional notation for this function. | |
| Apr 14 at 15:01 | comment | added | Max Alekseyev | I did not check the details carefully, but at first glance the recursion here allows a kind of binary search for computing $a(n)$ in a polynomial (possibly even linear) time in $\log n$. | |
| Apr 14 at 13:58 | comment | added | Notamathematician | @MaxAlekseyev, thank you for comment! Are you sure? Is there any objective way to compare these speeds? It works pretty fast even for $10^{100}$. | |
| Apr 14 at 13:47 | comment | added | Max Alekseyev | It's "without recursion" but at roughly same cost of computing sequence $b$ and figuring out where the new integers appear in it. So, the practical usefulness is limited. | |
| Apr 14 at 13:42 | history | edited | Max Alekseyev | CC BY-SA 4.0 |
case formula for a
|
| Apr 14 at 13:00 | history | asked | Notamathematician | CC BY-SA 4.0 |