I'm looking for asymptotically decreasing functions are there where the sum (probability mass) of the value corresponding to positive integers (x=1, 2, 3, ...) is 1 in the limit. Two extras would be nice:
It should be easy to calculate the sum of the values for the first
Nintegers, e.g. if N=3, then
some_expression(N) = f(1) + f(2) + f(3).
There should be a parameter that controls the "bendiness" of this function, e,g. how much it has decayed at x=3 relative to x=1.
I would assume that there are infinite such functions, but any are good. The simpler and the more ordinary, the better.
Context: This is to serve as a decay function in a model of human memory for lists of items. So subjects are presented with a list of pictures and should later recall them. These recalls are scored as correct/incorrect and modeled as binomial rates.
The model predicts that subjects have a list-length independent perfect recall for N pictures in the set and a non-perfect list-length dependent recall for the rest of the presented pictures. Specifically, for this imperfect recall, the probability of recall for each of these pictures decreases as the number of pictures increase but the number of pictures recalled in this range increases as more pictures are presented (hence I'm interested in the sum at integer values). So I would like to have a function for the recall rate
f which sums to 1 so that the total capacity for >N items can be expressed as