210789

Appears in sequences

• Numbers k such that gcd(k^2, reverse(k^2)) = k.at n=20A175823
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing even cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be even if it has an even number of entries. For example, the permutation (18)(2347)(569) has 2 increasing even cycles.at n=25A186764
• Number of permutations of {1,2,...,n} having no increasing even cycles. A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1)<b(2)<b(3)<... . A cycle is said to be even if it has an even number of entries.at n=9A186765
• Least k such that n-th repunit times k contains all digits from 1 to 9.at n=3A277057
• Irregular array by rows: A(n,m) is the least number which gives a number containing all nonzero digits when multiplied by m-th repunit for base n; each row is truncated when reaches its stationary point.at n=27A277058