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 A283893 #4 Mar 19 2017 19:25:51 %S A283893 3,2,3,5,2,8,2,8,5,4,10,10,6,13,7,8,9,9,8,20,9,8,20,13,12,19,15,11,22, %T A283893 16,12,28,11,28,15,17,28,13,29,25,18,22,21,28,22,22,24,32,21,31,36,17, %U A283893 26,39,30,28,37,25,36,28,23,57,33,14,64,19,35,32,56,26,29,43,44,28,36 %N A283893 Relative of Hofstadter Q-sequence: a(1) = 3, a(2) = 2; thereafter a(n) = a(n-a(n-1)) + a(n-a(n-2)). %C A283893 In calculating terms of this sequence, use the convention that a(n)=0 for n<=0. %C A283893 Much like the Hofstadter Q-sequence A005185, it is not known if this sequence is defined for all positive n. %C A283893 Empirically, this sequence appears to grow approximately like n/2 with a lot of noise. %H A283893 Nathan Fox, <a href="/A283893/b283893.txt">Table of n, a(n) for n = 1..10000</a> %p A283893 A283893:=proc(n) option remember: if n <= 0 then 0: elif n = 1 then 3: elif n = 2 then 2: else A283893(n-A283893(n-1)) + A283893(n-A283893(n-2)): fi: end: %Y A283893 Cf. A005185, A278066, A278067, A278068, A283894, A283895, A283896, A283897. %K A283893 nonn %O A283893 1,1 %A A283893 _Nathan Fox_, Mar 19 2017