OFFSET
1,1
COMMENTS
Sequence is infinite since it contains all positive multiples of 3. - Michel Marcus, Sep 04 2015
n such that gcd(n, A007953(n)) > 1. - Robert Israel, Sep 04 2015
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
The sum of digits of 15 is 6, and 6 is divisible by 3, a divisors of 15.
MAPLE
select(t -> igcd(t, convert(convert(t, base, 10), `+`)) > 1, [$1..1000]); # Robert Israel, Sep 04 2015
MATHEMATICA
fQ[n_] := AnyTrue[First /@ FactorInteger@ n, Divisible[Total@ IntegerDigits@ n, #] &]; Select[Range@ 120, fQ] // Rest (* Michael De Vlieger, Sep 04 2015, Version 10 *)
PROG
(PARI) isok(n) = {sd = sumdigits(n); fordiv(n, d, if (d > 1, if (! (sd % d), return (1))); ); } \\ Michel Marcus, Sep 04 2015
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Giovanni Teofilatto, Sep 04 2015
EXTENSIONS
More terms from Michel Marcus, Sep 04 2015
STATUS
approved