A330971 - OEIS

%I #15 Feb 09 2021 02:44:37

%S 0,10,12,18,40,72,90,100,102,108,110,120,126,132,140,150,180,190,210,

%T 222,240,252,288,300,312,336,340,400,410,420,440,450,490,510,522,540,

%U 552,558,616,672,720,810,828,882,900,910,940,990,1000,1002,1008,1010,1020

%N Numbers k such that for any decimal digit d in k, the remainder when k is divided by d+1 is 0.

%C If m belongs to this sequence, then 10*m also belongs to this sequence.

%C This sequence contains every multiple of 2520 (=lcm(1, 2, ..., 10)).

%H Rémy Sigrist, <a href="/A330971/b330971.txt">Table of n, a(n) for n = 1..10000</a>

%e 72 mod (7+1) = 0, and 72 mod (2+1) = 0, so 72 belongs to this sequence.

%o (PARI) is(n) = fromdigits(apply(d -> n%(d+1), digits(n)))==0

%Y Cf. A330970.

%K nonn,base

%O 1,2

%A _Rémy Sigrist_, Jan 05 2020