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 A105528 #1 Jul 19 2005 03:00:00
%S A105528 1,2,3,2,3,2,3,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,3,3,4,3,3,
%T A105528 3,3,3,3,4,3,3,3,3,3,4,3,3,3,3,3,4,3,3,3,3,4,3,3,3,3,3,4,3,3,3,3,4,3,
%U A105528 3,3,3,4,3,3,3,4,3,3,3,3,4,3,3,3,3,4,3,3,3,4,3,3,3,3,4,3,3
%N A105528 First differences of A105527.
%C A105528 Note that if n>9, a(n) is seemingly either 3 or 4. Checked up to index 200.
%o A105528 (PARI) {n_bonacci(n,v)= local(x,l);l=matsize(v)[2]; x=0;for(i=l-n+1,l,x+=v[i]);return(x)} {nbg(k)= local(q=[],l,v,m); for(n=3,k,v=[];for(i=1,n,v=concat(v,1));m=n; while((x=n_bonacci(n,v))<=fibonacci(m),v=concat(v,x);m+=1);q=concat(q,m)); return(q) } z=nbg(100);d=[];for(i=2,98,d=concat(d,z[i]-z[i-1]))
%Y A105528 Cf. A105527, A000045, A000213, A000288, A000322, A000383.
%K A105528 easy,nonn
%O A105528 0,2
%A A105528 Ferenc Adorjan (fadorjan(AT)freemail.hu), Apr 11 2005