|
| |
|
|
A090059
|
|
Numbers n divisible by exactly four nontrivial permutations (rearrangements) of the digits of n.
|
|
4
| | |
|
|
|
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.
|
|
|
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: A102328 A157111 A143162 * A151815 A186800 A205419
Adjacent sequences: A090056 A090057 A090058 * A090060 A090061 A090062
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Chuck Seggelin (barkeep(AT)plastereddragon.com), Nov 21 2003
|
| |
|
|
