cp's OEIS Frontend

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.

A031877 (numbers which are multiples of their reversals) and both A084687 and A090053 (numbers divided by number formed by sorting their digits), are subsets of this sequence. This sequence differentiates itself by including terms such as 7425 which is divided by 2475 (a rearrangement of 7425's digits that is neither a reversal or an ascending sort.)

Trivial permutations are identified as those where the permutation = k itself. Digit loss occurs when a permutation has 0 in the most significant position, which drops off, leaving a number with fewer digits. For example, when k is 3105, the permutation 0315 is excluded because 315 has fewer digits than 3105.

In the first million values of k, there is only one term that is divisible by three lossless nontrivial permutations. That term is 857142 which is divisible by 142857, 285714 and 428571. Note that 857142 is equal to floor((6/7)*10^6).

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.

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.

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.