|
%I #13 May 20 2017 21:59:32
%S 1,1,0,1,1,2,2,2,2,3,3,3,4,4,5,5,5,5,7,6,7,7,8,9,9,9,9,10,10,12,10,12,
%T 13,11,13,14,13,15,15,16,16,16,17,18,18,18,19,19,19,21,20,19,23,22,22,
%U 25,20,23,26,26,21,28,26,25,28,26,29,30,29,30,31,31,31,31,33,32,34,33
%N a(1) = a(2) = a(4) = 1; a(3) = 0; a(n) = a(n-a(n-1)-1) + a(n-a(n-2)-4) for n > 4.
%H Altug Alkan, <a href="/A283422/b283422.txt">Table of n, a(n) for n = 1..10000</a>
%H Altug Alkan, <a href="/A283422/a283422.png">Plot of first differences</a>
%t a[1] = a[2] = a[4] = 1; a[3] = 0; a[n_] := a[n] = a[n - a[n - 1] - 1] + a[n - a[n - 2] - 4]; Array[a, 78] (* _Michael De Vlieger_, May 15 2017 *)
%o (PARI) q=vector(10000); q[1]=q[2]=q[4]=1;q[3]=0; for(n=5, #q, q[n]=q[n-1-q[n-1]]+q[n-4-q[n-2]]); vector(10000, n, q[n])
%Y Cf. A005185.
%K nonn,look
%O 1,6
%A _Altug Alkan_, May 14 2017
|
