Timeline for Number of steps required to get one ball in each box for $n=2^k$
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 19, 2022 at 12:29 | vote | accept | Notamathematician | ||
| Oct 19, 2022 at 12:10 | comment | added | domotorp | I'm not so sure about that... Maybe you can pose it as another question and someone might answer it. | |
| Oct 19, 2022 at 10:57 | comment | added | Notamathematician | Thank you for answer! Could you please also prove the recurrence: $a(n)=\frac{n(n-1)}{2}-b(n)$ for $n>0$ where $b(n)=b(\left\lfloor\frac{n}{2}\right\rfloor)+c(\left\lceil\frac{n}{2}\right\rceil-2)+\left\lfloor\frac{n}{2}\right\rfloor-1$ for $n>3$, otherwise $b(n)=0$ and where $c(n)$ is A181132. | |
| Oct 19, 2022 at 6:51 | history | answered | domotorp | CC BY-SA 4.0 |