[seqfan] Is there a better way to find the terms of this sequence (other than trial and error)?

[Ali Sada]

Hi Everyone,
 
Please seethe sequence below. 

a(n)=m+1, where m is the least multiple of n which digits consist only of all thedistinct digits of n+1 and n+2. 

For example, 209 is the least multiple of 19 where m (209+1=210) consists only of the distinct digits of 20 and 21.


23, 43, 445,65, 76, 787, 988, 1009, 1111111111, 21, 1321, 11413, 4551, 561, 11176, 8817, 9181,1122229, 210, 221, 232, 243, 254, 265, 276, 287, 298, 22093, 1103, 3211, 32, 34433,3334

 

Sometimes itsstraightforward (n=19 to n=27), but other times it’s not.  
Is there aneasier way to find the terms of this sequence?
P.S. I am not sure I have the correct least numbers. I would appreciate it if someone could verify the results.

Best,

 

Ali