|
Search: id:A090059
|
|
|
| A090059 |
|
Numbers n divisible by exactly four nontrivial permutations (rearrangements) of the digits of n. |
|
+0
5
|
|
| 31050, 50490, 70200, 92070, 100035, 100980, 102060, 105000, 108000
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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.
|
|
LINKS
|
C. Seggelin, Numbers Divisible by Digit Permutations.
|
|
EXAMPLE
|
a(2)=50490 because 50490 is divisible by 459, 495, 594, and 4590, four nontrivial permutations of 50490.
|
|
CROSSREFS
|
Cf. A090055, A090057, A090058, A090060, A090061.
Sequence in context: A134118 A071124 A102328 this_sequence A113846 A140939 A134124
Adjacent sequences: A090056 A090057 A090058 this_sequence A090060 A090061 A090062
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Chuck Seggelin (barkeep(AT)plastereddragon.com), Nov 21 2003
|
|
|
Search completed in 0.002 seconds
|
