63978

Appears in sequences

• a(n) = Sum_{i=n..n+1} Sum_{j=i+1..n+2} Sum_{k=j+1..n+3} prime(i)*prime(j)*prime(k).at n=7A127349
• Number T(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=39A257740
• Number of multisets of nonempty words with a total of n letters over ternary alphabet such that all letters occur at least once in the multiset.at n=5A320213