cp's OEIS Frontend

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.

A090059 Numbers n divisible by exactly four nontrivial permutations (rearrangements) of the digits of n.

Original entry on oeis.org

31050, 50490, 70200, 92070, 100035, 100980, 102060, 105000, 108000
Offset: 1

Views

Author

Chuck Seggelin, Nov 21 2003

Keywords

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.

Examples

			50490 is a term because 50490 is divisible by 459, 495, 594 and 4590, four nontrivial permutations of 50490.
		

Crossrefs