login
A141022
a(n) = n mod ((sum of digits of n)+1).
2
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 2, 0, 3, 2, 1, 0, 8, 8, 8, 2, 1, 2, 5, 3, 1, 8, 7, 6, 5, 2, 1, 2, 5, 2, 8, 6, 4, 2, 0, 0, 5, 0, 3, 8, 5, 2, 11, 9, 7, 2, 2, 4, 8, 4, 0, 8, 5, 2, 14, 4, 5, 8, 3, 9, 5, 1, 11, 8, 5, 6, 8, 2, 7, 2, 10, 6, 2, 14, 11, 8, 1, 5, 11
OFFSET
0,3
LINKS
MAPLE
P:=proc(n) local i, k, w; for i from 1 by 1 to n do w:=0; k:=i; while k>0 do w:=w+k-trunc(k/10)*10; k:=trunc(k/10); od; print(i mod (w+1)); od; end: P(1000);
PROG
(PARI) a(n) = n % (1+sumdigits(n)); \\ Michel Marcus, Jun 04 2014
CROSSREFS
Cf. A007953.
Sequence in context: A309589 A309590 A169931 * A004720 A088118 A330633
KEYWORD
nonn,base,less
AUTHOR
Olivier Bouaziz (olivier.bouaziz(AT)arcelormittal.com), Jul 29 2008
EXTENSIONS
More terms from Michel Marcus, Jun 04 2014
STATUS
approved