114402
domain: N
Appears in sequences
- Positive numbers k such that k and 3*k are anagrams in base 5 (written in base 5).at n=29A023062
- 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=34A257740
- Number of multisets of nonempty words with a total of n letters over senary alphabet such that all letters occur at least once in the multiset.at n=1A320216