62634

Appears in sequences

• a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=1.at n=31A014563
• Smaller of Smith brothers.at n=27A050219
• Triangle read by rows: T(n,k) is the number of permutations of [n] with exactly k increasing runs of odd length.at n=50A097591
• G.f.: 1/(1 - 7 x + 15 x^2 - 6 x^3 - 11 x^4 + 6 x^5 + x^6).at n=8A122611
• Let x(1)x(2)...x(q) the decimal expansion of the numbers k having exactly q distinct prime divisors p(1) < p(2) < ... < p(q). Sequence lists the numbers k such that p(1)/x(q) + p(2)/x(q-1)+ ... + p(q)/x(1) is an integer.at n=31A235153