Timeline for Recurrence for the A284005
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 19, 2023 at 10:07 | comment | added | Peter Taylor | Since $T(n, \ell(n)) = 1$ the conjecture could equivalently be written as $$a(n) \stackrel?= a(f(n))+\sum\limits_{k=0}^{\ell(n)} a(f(n) + 2^{k}(1 - T(n,k)))$$ | |
| Apr 19, 2023 at 7:45 | history | edited | Notamathematician | CC BY-SA 4.0 |
added 44 characters in body
|
| Apr 19, 2023 at 7:02 | comment | added | Notamathematician | @Somos, thank you for comment! I usually check up to $10^6$. | |
| Apr 18, 2023 at 19:34 | comment | added | Somos | How far have you gone in checking this supposed recurrence numerically? | |
| Apr 18, 2023 at 9:05 | history | asked | Notamathematician | CC BY-SA 4.0 |