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 A240834 #5 Apr 16 2014 17:41:54 %S A240834 0,1,2,3,2,3,4,3,4,3,6,5,6,5,6,7,6,7,6,9,6,9,6,11,8,11,8,11,10,13,10, %T A240834 13,10,15,12,15,12,15,14,15,14,15,16,15,16,15,18,15,18,15,20,15,20,15, %U A240834 22,15,22,15,24,17,24,17,24,19,26,19,26,19,28,21,28,21,28,23,30,23,30,23,32,23,32,23,34,25,34,25,34 %N A240834 Sequence R(n) arising from analysis of structure of A046702. %D A240834 Callaghan, Joseph, John J. Chew III, and Stephen M. Tanny. "On the behavior of a family of meta-Fibonacci sequences." SIAM Journal on Discrete Mathematics 18.4 (2005): 794-824. See Eq. (3.1) and Table 3.1. %H A240834 <a href="/index/Ho#Hofstadter">Index entries for Hofstadter-type sequences</a> %p A240834 #T_s,k(n) from Callaghan et al. Eq. (3.1). %p A240834 s:=0; k:=3; %p A240834 T:=proc(n) option remember; global R,U,s,k; # A046702 %p A240834 if n <= s+k then 1 %p A240834 else %p A240834 add(U(n-i),i=0..k-1); %p A240834 fi; end; %p A240834 U:=proc(n) option remember; global R,T,s,k; # A240833 %p A240834 T(R(n)); end; %p A240834 R:=proc(n) option remember; global U,T,s,k; # A240834 %p A240834 n-s-T(n-1); end; %p A240834 t1:=[seq(R(n),n=1..100)]; %Y A240834 Cf. A046702, A240833. %K A240834 nonn %O A240834 1,3 %A A240834 _N. J. A. Sloane_, Apr 16 2014