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

I wonder if the recurrence equations for the number of spanning trees in the GxP_n graphs also meet the log recuirement.





I wonder if somebody already has scanned the OEIS for all recurrent relations that are "log concave". These are mentioned on https://oeis.org/wiki/Index_to_OEIS:_Section_Rec . just scanning the page, I guess there are not so many that are unimodal and log concave.



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

Search: