176904
domain: N
Appears in sequences
- Number of strings over Z_3 of length n with trace 0 and subtrace 1.at n=12A073948
- Number of strings over Z_3 of length n with trace 0 and subtrace 2.at n=12A073949
- Number of strings over Z_3 of length n with trace 1 and subtrace 1.at n=12A073951
- Number of strings over Z_3 of length n with trace 1 and subtrace 2.at n=12A073952
- Number of elements of GF(3^n) with trace 0 and subtrace 1.at n=12A074001
- Number of elements of GF(3^n) with trace 0 and subtrace 2.at n=12A074002
- Number of elements of GF(3^n) with trace 1 and subtrace 1.at n=12A074004
- Number of elements of GF(3^n) with trace 1 and subtrace 2.at n=12A074005
- a(n) = n^2*(n^2 - 1)/3.at n=27A112742
- Expansion of x^2*(1-x)/((1-3*x)*(1-3*x^2)).at n=12A122006
- Expansion of 2*x^2*(1-2*x) / ((3*x-1)*(3*x^2-1)).at n=12A122007
- Inverse binomial transform of (A113405 preceded by 0).at n=13A133474
- Binomial transform of A131666.at n=13A135254
- Numbers with prime factorization pqr^3s^5.at n=26A190475
- Product of cumulative sums of divisors of n.at n=17A197410
- a(n) = 3^(n-1)*(3^n - 1), n >= 0.at n=6A219205
- Triangle read by rows. T(n,k) is the number of n X n diagonalizable matrices over GF(3) that have rank k, 0 <= k <= n, n >= 0.at n=22A297892
- a(1) = 2, a(2) = 4, a(3) = 6; for n > 3, a(n) = 3*a(n-1) - 3*a(n-2) + 9*a(n-3).at n=11A318609
- a(1) = 0, a(2) = 4, a(3) = 12; for n > 3, a(n) = 3*a(n-1) - 3*a(n-2) + 9*a(n-3).at n=11A318610