Re: I function F(x) that tells me,how do i put the balls in the beans



On 20 Feb, 23:18, Gerry Myerson <g...@xxxxxxxxxxxxxxxxxxxxxxxxx>
wrote:
In article <1171956747.954351.310...@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,

"Jakob" <jakobsson....@xxxxxxxxx> wrote:
I am looking for a procedure, n-choose-k (if possibly), but 128-
choose-8 is also ok. I looking for a way to get [F(n)from F(n-1),
n=1....M] where the length of n should be as long as possibly. So I do
not need to get for example F(1672873) directly.

http://director-online.com/buildArticle.php?id=1111

ieeexplore.ieee.org/iel5/8782/27813/01240626.pdf

ieeexplore.ieee.org/iel3/ 3853/11247/00539062.pdf?arnumber=539062

doi.ieeecomputersociety.org/10.1109/ICPP.1996.539062

[I think the last two are the same]

mail.python.org/pipermail/ python-list/2001-January/066472.html

answers.google.com/answers/threadview?id=343709

groups.google.co.ug/group/algogeeks/
browse_thread/thread/427807f36709bfb2

--
Gerry Myerson (g...@xxxxxxxxxxxxxxx) (i -> u for email)

Thanks, there was a lot of good material in the pages

Jakob

.