177633
domain: N
Appears in sequences
- a(n) = (1/3)*(n^2 + 2*n + 3)*(n+1)^2.at n=26A014820
- "BIK" (reversible, indistinct, unlabeled) transform of 2,2,2,2...at n=11A032124
- Let G_n be the elementary Abelian group G_n = (C_3)^n; a(n) is the number of times the number 1 appears in the character table of G_n.at n=5A061253
- Number of strings over Z_3 of length n with trace 0 and subtrace 0.at n=12A073947
- Number of strings over Z_3 of length n with trace 1 and subtrace 0.at n=12A073950
- Number of elements of GF(3^n) with trace 0 and subtrace 0.at n=12A074000
- Number of elements of GF(3^n) with trace 1 and subtrace 0.at n=12A074003
- a(n) = (3^n + 2*3^(n/2)*cos(n*Pi/6))/3.at n=12A092236
- a(1) = a(2) = 1, a(3) = 9; for n > 3, a(n) = 3*a(n-1) - 3*a(n-2) + 9*a(n-3).at n=11A101990
- Expansion of (2*x-1)*(x-1)*x / ((3*x-1)*(3*x^2-1)).at n=12A122008
- Crystal ball sequence for the lattice C_4.at n=13A142993
- Number of 8X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 8 zero-sum 2-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=21A192708
- Number of (n+1) X (2+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.at n=11A262326
- a(n) is the number of words of length n on the alphabet {0,1,2} with the number of 0's plus the number of 1's congruent to the number of 2's modulo 3.at n=12A334656