This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A075529 #13 Feb 21 2025 09:40:01
%S A075529 1,1,2,4,8,16,30,55,98,175,310,555,986,1757,3138,5618
%N A075529 Let x(0),...,x(n), be an additive chain of length n+1 with x(0)=1 and satisfying x(k) = x(k-1) + x(j) for some j < k. a(n) is the number of distinct possible values taken on by x(n).
%H A075529 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 A075529 E. Ben-Naim, <a href="http://cnls-www.lanl.gov/People/ebn/pubs/reccur/reccur.html">Home page</a>
%H A075529 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a075/A075529.java">Java program</a> (github)
%e A075529 Let X(n) denote the set of possible values for x(n), then X(0) = {1} hence a(0) = 1, X(1) = {2} hence a(1)=1, X(2) = {3,4} hence a(2)=2, X(3) = {4,5,6,8} hence a(3)=4.
%K A075529 nonn,more
%O A075529 0,3
%A A075529 Eli Ben-Naim (ebn(AT)lanl.gov), Sep 19 2002
%E A075529 Entry revised by _Sean A. Irvine_, Feb 20 2025