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 A240833 #6 Apr 16 2014 17:40:46 %S A240833 1,1,1,1,1,3,1,3,1,3,3,3,3,3,5,3,5,3,7,3,7,3,7,5,7,5,7,5,9,5,9,5,9,7, %T A240833 9,7,9,9,9,9,9,11,9,11,9,13,9,13,9,15,9,15,9,17,9,17,9,17,11,17,11,17, %U A240833 11,19,11,19,11,19,13,19,13,19,13,21,13,21,13,23,13,23,13,23,15,23,15,23,17,23,17,23,17 %N A240833 Sequence U(n) arising from analysis of structure of A046702. %D A240833 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 A240833 <a href="/index/Ho#Hofstadter">Index entries for Hofstadter-type sequences</a> %p A240833 #T_s,k(n) from Callaghan et al. Eq. (3.1). %p A240833 s:=0; k:=3; %p A240833 T:=proc(n) option remember; global R,U,s,k; # A046702 %p A240833 if n <= s+k then 1 %p A240833 else %p A240833 add(U(n-i),i=0..k-1); %p A240833 fi; end; %p A240833 U:=proc(n) option remember; global R,T,s,k; # A240833 %p A240833 T(R(n)); end; %p A240833 R:=proc(n) option remember; global U,T,s,k; # A240834 %p A240833 n-s-T(n-1); end; %p A240833 t1:=[seq(U(n),n=2..100)]; %Y A240833 Cf. A046702, A240834. %K A240833 nonn %O A240833 2,6 %A A240833 _N. J. A. Sloane_, Apr 16 2014