A257001 Numbers such that the largest missing digit is a divisor.

18, 27, 36, 45, 54, 63, 72, 81, 96, 98, 108, 117, 126, 135, 144, 153, 162, 171, 180, 189, 192, 207, 216, 225, 234, 243, 252, 261, 270, 288, 296, 306, 315, 324, 333, 342, 351, 360, 378, 387, 392, 405, 414, 423, 432, 441, 450, 468, 477, 486, 496, 504, 513, 522

Offset: 1

Author

Eric Angelini and Reinhard Zumkeller, Apr 14 2015

Keywords

• nonn
• base

Comments

a(n) mod A000030(A230959(a(n))) = 0.

Pandigital numbers are not terms: A171102, A050278.

The original definition used the phrase "largest absent digit".

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
• Éric Angelini, Absent digit, SeqFan list, Apr 14 2015.

Crossrefs

Cf. A000030, A230959, A050278, A116667, A171102.

Programs

Haskell

import Data.List ((\\)); import Data.Char (digitToInt)
a257001 n = a257001_list !! (n-1)
a257001_list = filter f [1..] where
   f x = h > 0 && mod x h == 0 where h = a000030 $ a230959 x

Mathematica

f[x_]:=Union[Sort[IntegerDigits[x]]];
d={1,2,3,4,5,6,7,8,9};
Select[Range[525],And[f[#]!=d,Length[f[#]]<10,IntegerQ[#/Max[Complement[d,f[#]]]]]&] (* Ivan N. Ianakiev, Apr 14 2015 *)