1047552

Appears in sequences

• Number of Barlow packings with group P6(bar)m2 that repeat after 2n layers.at n=21A011949
• Expansion of g.f.: 2*x*(1-x)/((1-2*x)*(1-2*x^2)).at n=20A014236
• a(n) = 4^n - 2^n.at n=10A020522
• Number of reversible strings with n beads of 2 colors. If more than 1 bead, not palindromic.at n=20A032085
• Nextprime(4^n)-nextprime(2^n).at n=10A037130
• Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 1".at n=22A038504
• Number of elements of GF(2^n) with trace 1 and subtrace 1.at n=22A038521
• Number of 2n-bead balanced binary necklaces which are equivalent to their reversed complement, but not equivalent to their reverse and complement.at n=21A045678
• a(n) = n*(n-1)^2*(n-2).at n=31A047928
• Jordan function J_10(n).at n=3A069095
• Number of words of length 2n in the two letters s and t that reduce to the identity 1 by using the relations ssTT=1, ststSS=1 and ststTT=1, where S and T are the inverses of s and t, respectively (i.e., sS=1 and tT=1). The generators s and t and the three stated relations generate the quaternion group Q4.at n=10A071930
• Number of strings of length n over GF(4) with trace 0 and subtrace 1.at n=11A073996
• Number of compositions of n with an odd number of 1's.at n=21A113980
• G.f.: 1/((1-2*x)*(1-2*x^2)).at n=19A122746
• a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) for n >= 4 starting with a(0) = 1, a(1) = 2, a(2) = 4, and a(3) = 6.at n=21A131885
• a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3), n > 3; a(0) = 1, a(1) = 4, a(2) = 12, a(3) = 32.at n=18A133212
• Duplicate of A038521.at n=22A134654
• Numbers in the array A137171.at n=47A137172
• Interleave A038504 with A131577.at n=44A137776
• a(n) = 2^(p - 2)*(2^p - 2), where p = prime(n).at n=4A141083