#Wolfram Language 103 bytes
Wolfram Language 103 bytes
Uses 1-indexing. I'm surprised it required so much code.
(k=1;u=Union;n=2;l=Length;While[k<#,If[l[a=Join@@u/@IntegerDigits@Divisors@#]==l@u@a&@n,k++];n++];n-1)&
#Wolfram Language 103 bytes
Uses 1-indexing. I'm surprised it required so much code.
(k=1;u=Union;n=2;l=Length;While[k<#,If[l[a=Join@@u/@IntegerDigits@Divisors@#]==l@u@a&@n,k++];n++];n-1)&
Wolfram Language 103 bytes
Uses 1-indexing. I'm surprised it required so much code.
(k=1;u=Union;n=2;l=Length;While[k<#,If[l[a=Join@@u/@IntegerDigits@Divisors@#]==l@u@a&@n,k++];n++];n-1)&