cp's OEIS Frontend

A244483 a(0)=3, a(1)=1, a(2)=0; thereafter a(n) = a(n-1-a(n-1))+a(n-2-a(n-2)) unless a(n-1) <= n-1 or a(n-2) <= n-2 in which case the sequence terminates.

%I A244483 #8 Jul 07 2014 02:32:16
%S A244483 3,1,0,3,3,4,2,4,6,3,2,8,9,6,7,8,8,10,10,10,9,11,10,11,18,11,9,17,12,
%T A244483 10,18,19,18,16,17,20,18,18,20,20,20,19,19,21,21,21,29,28,20,22,29,28,
%U A244483 22,29,36,28,27,27,28,36,29,30,38,37,27,27,38,32,32,38,37,35,34,38,40,37,37,40,38,38,39
%N A244483 a(0)=3, a(1)=1, a(2)=0; thereafter a(n) = a(n-1-a(n-1))+a(n-2-a(n-2)) unless a(n-1) <= n-1 or a(n-2) <= n-2 in which case the sequence terminates.
%D A244483 Higham, Jeff and Tanny, Stephen, A tamely chaotic meta-Fibonacci sequence. Twenty-third Manitoba Conference on Numerical Mathematics and Computing (Winnipeg, MB, 1993). Congr. Numer. 99 (1994), 67-94.
%H A244483 Reinhard Zumkeller, <a href="/A244483/b244483.txt">Table of n, a(n) for n = 0..10000</a>
%H A244483 <a href="/index/Ho#Hofstadter">Index entries for Hofstadter-type sequences</a>
%p A244483 f := proc(n) option remember;
%p A244483     if n=0 then 3
%p A244483     elif n=1 then 1
%p A244483     elif n=2 then 0
%p A244483     else
%p A244483     f(n-1-f(n-1))+f(n-2-f(n-2));
%p A244483     fi;
%p A244483 end proc;
%p A244483 [seq(f(n),n=0..80)];
%o A244483 (Haskell)
%o A244483 a244483 n = a244483_list !! n
%o A244483 a244483_list = 3 : 1 : 0 : zipWith (+) xs (tail xs)
%o A244483    where xs = map a244483 $ zipWith (-) [1..] $ tail a244483_list
%o A244483 -- _Reinhard Zumkeller_, Jul 07 2014
%Y A244483 See A006949 for overview of sequences produced by this recurrence and various initial conditions.
%K A244483 nonn
%O A244483 0,1
%A A244483 _N. J. A. Sloane_, Jul 03 2014