Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #2 Feb 24 2006 03:00:00
%S 0,0,1,2,3,6,10,18,28,50,79,144,249,432,756
%N Number of gaps in the set of all possible values in a stochastic sequence.
%H E. Ben-Naim and P. L. Krapivsky, <a href="http://arXiv.org/abs/cond-mat/0208072">Growth and Structure of Stochastic Sequences</a>, J. Phys. A (2002).
%H E. Ben-Naim, <a href="http://cnls-www.lanl.gov/People/ebn/pubs/reccur/reccur.html">Home page</a>
%F Stochastic sequence recursive (Fibonacci-like) rule: x_n=x_{n-1}+x_p with randomly chosen p=0, ..., n-1 (x_0=1)
%e x_1=2 hence a(1)=0 x_2=3,4 hence a(2)=0 x_3=4,5,6,8 hence a(3)=1
%K nonn
%O 1,4
%A Eli Ben-Naim (ebn(AT)lanl.gov), Sep 19 2002