Timeline for Estimation of number of ways to concatenate strings of the form $01^k2^k$ to create a string of length n
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 25, 2013 at 2:58 | vote | accept | Scott Conrad | ||
| Aug 16, 2013 at 14:33 | answer | added | Benjamin Steinberg | timeline score: 2 | |
| Aug 16, 2013 at 0:29 | answer | added | Gerry Myerson | timeline score: 3 | |
| Aug 16, 2013 at 0:28 | comment | added | The Masked Avenger | It seems to me that p(n) satsfies the Fibonacci recurrence. I suspect your question will soon be migrated. | |
| Aug 16, 2013 at 0:18 | review | First posts | |||
| Aug 16, 2013 at 0:19 | |||||
| Aug 16, 2013 at 0:17 | comment | added | The Masked Avenger | It depends on how weak a bound you will accept. Using p(n), declare p(n) is at most 3^(alpha n), write a recurrence for p, and see what that tells you about alpha. | |
| Aug 16, 2013 at 0:02 | history | asked | Scott Conrad | CC BY-SA 3.0 |