login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A090058
Numbers n divisible by exactly three nontrivial permutations (rearrangements) of the digits of n.
4
4050, 8100, 10500, 10530, 10800, 34020, 51000, 54000, 60912, 68040, 70300, 80190, 95040, 100100, 100500, 100800, 102000, 105030
OFFSET
1,1
COMMENTS
Trivial permutations are identified as (1) permutation = n, or (2) when n mod 10=0, permutations of n's digits which result in shifting only trailing zeros to the most significant side of n where they drop off, such that permutation = n/10^z, where z <= the number of trailing zeros of n. So if n were 1809000, the following permutations would be excluded as trivial: 1809000, 0180900, 0018090, 0001809.
EXAMPLE
60912 is a term because 60912 is divisible by 1269, 1296 and 1692, three nontrivial permutations of 60912.
CROSSREFS
KEYWORD
nonn,base,more
AUTHOR
Chuck Seggelin (barkeep(AT)plastereddragon.com), Nov 21 2003
STATUS
approved