46560

Appears in sequences

• Consider a decimal number of k>=2 digits x = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + ... + d_(2)*10 + d_(1) and the transform T(x)-> (d_(k)+d_(k-1) mod 10)*10^(k-1) + (d_(k-1)+d_(k-2) mod 10)*10^(k-2) + ... + (d_(2)+d_(1) mod 10)*10 + (d_(1)+d(k) mod 10). Sequence lists the numbers x such that T(x) divides x.at n=17A244286
• Number of factorizations of n! into factors > 1 that can be obtained by taking the multiset union of a choice of factorizations of each positive integer from 2 to n into factors > 1.at n=22A321468
• Number of factorizations of n! into factors > 1 that can be obtained by taking the multiset union of a choice of factorizations of each positive integer from 2 to n into factors > 1.at n=23A321468
• a(n) is the smallest number which can be represented as the sum of n distinct nonzero n-gonal numbers in exactly n ways, or 0 if no such number exists.at n=19A350405