Hacker News new | past | comments | ask | show | jobs | submit login

https://oeis.org/A007477

“For n>=2, a(n) gives number of possible ways to parse an English sentence consisting of just n+1 copies of word "buffalo", with one particular "plausible" grammar.”




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: