|
Search: id:A090061
|
|
|
| A090061 |
|
Numbers n divisible by exactly two nontrivial permutations (rearrangements) of the digits of n, excluding all permutations that result in digit loss. |
|
+0
6
|
|
| 571428, 867132, 874125, 923076, 5179428, 5714028, 5714280, 5714820, 5719428, 5971428, 8524710, 8571042, 8671320, 8679132, 8741250, 8749125, 8914752, 8957142, 9230760, 9239076, 37451268, 41957028, 42195708, 42713568, 42915780
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Trivial permutations are identified as those where the permutation = n itself. Digit loss occurs when a permutation has 0 in the most significant position, which drops off, leaving a number with fewer digits. For example, when n is 3105, the permutation 0315 is excluded because 315 has fewer digits than 3105.
In the first million values of n, there is only one term that is divisible by three lossless nontrivial permutations. That term is 857142 which is divisible by 142857, 285714 and 428571. Note that 857142 is equal to floor((6/7)*10^6).
|
|
LINKS
|
C. Seggelin, Numbers Divisible by Digit Permutations.
|
|
EXAMPLE
|
a(4)=923076 because 923076 is divisible by both 230769 and 307692, two nontrivial permutations of 923076 with the same number of digits.
|
|
CROSSREFS
|
Cf. A090056, A090057.
Adjacent sequences: A090058 A090059 A090060 this_sequence A090062 A090063 A090064
Sequence in context: A156412 A068724 A121169 this_sequence A146947 A119402 A050518
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Chuck Seggelin (barkeep(AT)plastereddragon.com), Nov 21 2003
|
|
EXTENSIONS
|
a(5)-a(25) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Sep 16 2009
|
|
|
Search completed in 0.002 seconds
|
