A090060 Numbers n divisible by exactly five nontrivial permutations (rearrangements) of the digits of n.

40500, 81000, 98010, 105300

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

Table of n, a(n) for n=1..4.

C. Seggelin, Numbers Divisible by Digit Permutations.

Example

a(3)=98010 because 98010 is divisible by 198, 891, 1089, 8910 and 10890, five nontrivial permutations of 98010.

Crossrefs

Cf. A090055, A090057, A090058, A090059, A090061.

Sequence in context: A216290 A237970 A218399 * A250955 A334004 A097238

Adjacent sequences: A090057 A090058 A090059 * A090061 A090062 A090063

Keyword

nonn,base

Author

Chuck Seggelin (barkeep(AT)plastereddragon.com), Nov 21 2003

Status

approved