1,1

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.

C. Seggelin, Numbers Divisible by Digit Permutations.

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

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

Sequence in context: A071550 A072269 A033984 this_sequence A097238 A046180 A164648

Adjacent sequences: A090057 A090058 A090059 this_sequence A090061 A090062 A090063

nonn,base

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