107710

Appears in sequences

• Floor[ concatenation of n+2, n+1 and n divided by 3 ].at n=30A075004
• Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 7.at n=20A136860
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing odd 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 odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 3 increasing odd cycles.at n=59A186761