OFFSET
1,3
COMMENTS
A283593 gives the least m > 0 as described in the name.
Numbers t such that t and 2*t are both in this sequence are 0, 1, 49, 98, 1249, 2599, 3784, 9565, 10933, ... - Altug Alkan, Mar 11 2017
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..10000
EXAMPLE
(7 mod 1) + (7 mod 2) + (7 mod 3) + (7 mod 4) + (7 mod 5) = 0 + 1 + 1 + 3 + 2 = 7, hence 7 appears in this sequence.
(4 mod 1) + (4 mod 2) + (4 mod 3) + (4 mod 4) = 0 + 0 + 1 + 0 = 1, and (4 mod 1) + (4 mod 2) + (4 mod 3) + (4 mod 4) + (4 mod 5) = 0 + 0 + 1 + 0 + 4 = 5, hence 4 does not appear in this sequence.
PROG
(PARI) isok(n) = my (s=0); my (k=1); while (s<n, s += n%k; k++); return (s==n)
CROSSREFS
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Mar 11 2017
STATUS
approved