43053282

Appears in sequences

• "BIK" (reversible, indistinct, unlabeled) transform of 2,2,2,2...at n=16A032124
• Sums of two distinct powers of 9.at n=32A038487
• Number of periodic palindromic structures of length n using a maximum of three different symbols.at n=34A056504
• Number of strings over Z_3 of length n with trace 0 and subtrace 1.at n=17A073948
• Number of strings over Z_3 of length n with trace 0 and subtrace 2.at n=17A073949
• a(n) = 3^n + 9^n.at n=8A074610
• Expansion of 2*x^2*(1-2*x) / ((3*x-1)*(3*x^2-1)).at n=17A122007
• Binomial transform of A131666.at n=18A135254
• Numbers that are sums of 8th powers of 2 distinct positive integers.at n=30A155468
• 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=16A318609
• 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=17A334656
• a(n) = n^8 * Product_{p|n, p prime} (1 + 1/p^8).at n=8A351303
• a(n) = n^8 * Sum_{d^2|n} 1 / d^8.at n=8A351606
• Sum of the 8th powers of the divisor complements of the odd proper divisors of n.at n=8A352054
• 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=6A391469
• 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 == 2 (mod 3).at n=6A391470