847290203766
domain: N
Appears in sequences
- Number of strings over Z_3 of length n with trace 0 and subtrace 2.at n=26A073949
- Dirichlet g.f.: Product_{k>=2} 1 / (1 - k^(-s))^(3^(k-1)).at n=25A344247
- Dirichlet g.f.: Product_{k>=2} (1 + k^(-s))^(3^(k-1)).at n=25A344266
- Number of words of length 3*n that can be formed with a three-letter alphabet when the number of letters of each type is == 1 (mod 3).at n=9A391469