The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A090058 Numbers n divisible by exactly three nontrivial permutations (rearrangements) of the digits of n. 4

%I #10 Jun 05 2024 04:25:20

%S 4050,8100,10500,10530,10800,34020,51000,54000,60912,68040,70300,

%T 80190,95040,100100,100500,100800,102000,105030

%N Numbers n divisible by exactly three nontrivial permutations (rearrangements) of the digits of n.

%C 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.

%H Chuck Seggelin, <a href="https://web.archive.org/web/20040621151703/http://www.plastereddragon.com:80/maths/asortdiv.htm">Numbers Divisible by Digit Permutations</a>.

%e 60912 is a term because 60912 is divisible by 1269, 1296 and 1692, three nontrivial permutations of 60912.

%Y Cf. A090055, A090057, A090059, A090060, A090061.

%K nonn,base,more

%O 1,1

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 4 07:29 EDT 2024. Contains 374905 sequences. (Running on oeis4.)