70132

Appears in sequences

• G.f. satisfies: A(x) = exp( Sum_{n>=1} (Sum_{k=0..2*n} A027907(n,k)^2 * x^k * A(x)^(2*k)) * x^n*A(x)^n/n ), where A027907 is the triangle of trinomial coefficients.at n=8A200475
• Number of ways to write highly composite numbers (A002182(n)) as the difference of two primes, both <= 2*A002182(n).at n=41A228945
• Number of multisets of nonempty words with a total of n letters over denary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=11A293740
• a(n) is the smallest positive integer not yet in the increasing sequence that is obtained when the largest digit from a(n-1) is deleted and the remaining digits are permuted such that no digit in a(n) has the same position it had in a(n-1) (counting from left to right). No repeated digits allowed; a(1)=10.at n=22A302095