19255

Appears in sequences

• k! + k# + 1 is prime, where k# is the primorial function.at n=17A081710
• Number of composite numbers between exponents of successive Mersenne primes.at n=25A157894
• Number T(n,k) of words w of length n such that each letter of the k-ary alphabet is used at least once and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=59A257783
• Sum T(n,k) of the k-th entries in all blocks of all set partitions of [n]; triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=40A285595
• Number of words w of length n such that each letter of the quaternary alphabet is used at least once and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=6A321840
• a(n) = A115004(n) - A334701(n).at n=22A335179
• a(n) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly n ways, or 0 if no such number exists.at n=36A350241