login
A094295
a(1) = 1, a(n) = remainder on dividing the concatenation of all previous terms by n.
2
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, 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, 49, 33, 32, 52, 6, 42, 14, 22, 32, 58, 61, 45, 45, 15, 38, 2, 21, 45, 70, 22, 71, 11, 5, 75
OFFSET
1,3
LINKS
EXAMPLE
a(9) = 7 = 11200444 (mod 9).
MATHEMATICA
f[l_List] := Append[l, Mod[FromDigits[Join @@ IntegerDigits[l]], Length[l] + 1]]; Nest[f, {1}, 80] (* Ray Chandler, Feb 05 2007 *)
PROG
(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
CROSSREFS
Cf. A094296.
Sequence in context: A342276 A137505 A107498 * A085969 A115179 A117434
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, Apr 28 2004
EXTENSIONS
Extended by Ray Chandler, Feb 05 2007
STATUS
approved