|
%I #11 Dec 21 2019 15:27:09
%S 1,1,2,0,0,4,4,4,7,7,2,8,4,12,2,10,4,0,6,6,9,9,21,9,19,17,24,12,19,19,
%T 17,13,29,13,3,29,1,7,24,4,32,36,5,1,6,0,28,28,17,17,12,28,15,13,53,9,
%U 49,33,32,52,6,42,14,22,32,58,61,45,45,15,38,2,21,45,70,22,71,11,5,75
%N a(1) = 1, a(n) = remainder on dividing the concatenation of all previous terms by n.
%H Rémy Sigrist, <a href="/A094295/b094295.txt">Table of n, a(n) for n = 1..10000</a>
%e a(9) = 7 = 11200444 (mod 9).
%t f[l_List] := Append[l, Mod[FromDigits[Join @@ IntegerDigits[l]], Length[l] + 1]];Nest[f, {1}, 80] (* _Ray Chandler_, Feb 05 2007 *)
%o (PARI) p=0; for (n=1, 80, print1 (v=if (n==1, 1, p%n)", "); p=p*10^max(1,#digits(v))+v) \\ _Rémy Sigrist_, Dec 21 2019
%Y Cf. A094296.
%K base,nonn
%O 1,3
%A _Amarnath Murthy_, Apr 28 2004
%E Extended by _Ray Chandler_, Feb 05 2007
|
