|
Search: id:A090058
|
|
|
| A090058 |
|
Numbers n divisible by exactly three nontrivial permutations (rearrangements) of the digits of n. |
|
+0
5
|
|
| 4050, 8100, 10500, 10530, 10800, 34020, 51000, 54000, 60912, 68040, 70300, 80190, 95040, 100100, 100500, 100800, 102000, 105030
(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(9)=60912 because 60912 is divisible by 1269, 1296 and 1692, three nontrivial permutations of 60912.
|
|
CROSSREFS
|
Cf. A090055, A090057, A090059, A090060, A090061.
Sequence in context: A034229 A060896 A001382 this_sequence A035782 A108006 A020430
Adjacent sequences: A090055 A090056 A090057 this_sequence A090059 A090060 A090061
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Chuck Seggelin (barkeep(AT)plastereddragon.com), Nov 21 2003
|
|
|
Search completed in 0.002 seconds
|
