login
a(1) = ... = a(6) = 1; a(n)=a(n-a(n-1))+a(n-a(n-6)).
2

%I #12 Apr 18 2014 16:03:36

%S 1,1,1,1,1,1,2,3,4,5,6,7,7,8,8,9,9,10,11,11,12,12,14,13,15,14,15,16,

%T 15,17,17,18,18,19,20,20,20,21,22,22,23,23,25,25,25,25,25,29,24,29,26,

%U 29,29,30,32,28,32,29,34,31,32,36,32,38,32,39,36,36,38,36,42,35,41,39,40

%N a(1) = ... = a(6) = 1; a(n)=a(n-a(n-1))+a(n-a(n-6)).

%C The sequence dies after 2354 terms. - _N. J. A. Sloane_, Apr 15 2014

%H T. D. Noe, <a href="/A134679/b134679.txt">Table of n, a(n) for n = 1..2354</a> (complete sequence)

%t Clear[a]; a[n_] := a[n] = If[n<=6, 1, a[n-a[n-1]]+a[n-a[n-6]]]; t={1}; n=2; While[n<10000 && a[n-1]<n, AppendTo[t,a[n]]; n++ ]; t

%Y Cf. A132172.

%K nonn,fini

%O 1,7

%A _T. D. Noe_, Nov 06 2007