|
%I #17 Oct 01 2017 09:17:58
%S 1,1,2,3,3,3,4,4,5,5,5,6,6,6,7,7,8,8,8,9,9,9,9,10,10,10,11,11,11,11,
%T 12,12,12,12,12,13,13,13,13,14,14,14,14,14,15,15,16,16,16,16,16,17,17,
%U 17,17,17,18,18,18,18,18,18,19,19,19,20,20,21,21,21,21,21,22,22,22,22,22
%N a(1) = a(2) = 1; for n > 2, a(n) = a(a(a(n-2))) + a(n-a(n-2)).
%C A triply recursive version of A005229.
%t a[1] = a[2] = 1;
%t a[n_Integer?Positive] := a[n] =a[a[a[n-2]]] +a[n - a[n-2]];
%t Table[a[n], {n, 1, 200}]
%o (PARI) a=vector(100); a[1]=a[2]=1; for(n=3, #a, a[n] = a[a[a[n-2]]]+a[n-a[n-2]]); a \\ _Altug Alkan_, Oct 01 2017
%Y Cf. A005229, A005374.
%K nonn,easy
%O 1,3
%A _Roger L. Bagula_, Oct 06 2003
|
