This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A090059 #11 Jun 08 2025 16:15:42 %S A090059 31050,50490,70200,92070,100035,100980,102060,105000,108000 %N A090059 Numbers n divisible by exactly four nontrivial permutations (rearrangements) of the digits of n. %C A090059 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 A090059 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 A090059 50490 is a term because 50490 is divisible by 459, 495, 594 and 4590, four nontrivial permutations of 50490. %Y A090059 Cf. A090055, A090057, A090058, A090060, A090061. %K A090059 nonn,base,more %O A090059 1,1 %A A090059 _Chuck Seggelin_, Nov 21 2003