%I
%S 0,0,0,0,0,0,0,0,0,1,1,2,4,8,16,23,28,37,44,40,37,42,38,39,43,46,46,
%T 50,44,40,37,37,37,42,40,40,34,31,25,26,30,29,33,35,36,37,44,41,40,36,
%U 36,35,35,38,45,45,45,46,48,49,53,52,50,45,42,35,35,36,40,35,37,39,43,41
%N Next term is the sum of the previous 10 digits in the sequence.
%C Digits, not terms!
%C There are only 10^10 possibilities for the last 10 digits, so the sequence must eventually cycle.
%C Cycles at n(19)=44 and the loop has 312 terms.  _Hans Havermann_
%C Terms computed by Gilles Sadowski.
%e 0 + 0 + 1 + 1 + 2 + 4 + 8 + 1 + 6 = 23
%t a[1] = a[2] = a[3] = a[4] = a[5] = a[6] = a[7] = a[8] = a[9] = 0; a[10] = 1; a[n_] := a[n] = Plus @@ Take[ Flatten@Table[IntegerDigits[a[i]], {i, n  10, n  1}], 10]; Array[a, 74] (* _Robert G. Wilson v_, Dec 09 2005 *)
%K base,easy,nonn
%O 1,12
%A _Eric Angelini_, Dec 05 2005
