261632

Appears in sequences

• Expansion of g.f.: 2*x*(1-x)/((1-2*x)*(1-2*x^2)).at n=18A014236
• a(n) = 4^n - 2^n.at n=9A020522
• Number of reversible strings with n beads of 2 colors. If more than 1 bead, not palindromic.at n=18A032085
• Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 0".at n=20A038503
• Number of elements of GF(2^n) with trace 0 and subtrace 1.at n=20A038519
• Number of 2n-bead balanced binary necklaces which are equivalent to their reversed complement, but not equivalent to their reverse and complement.at n=19A045678
• Number of 2n-bead balanced binary necklaces of fundamental period 2n which are equivalent to their reversed complement, but are not equivalent to their reverse and complement.at n=19A045687
• Number of primitive (aperiodic) palindromic structures of length n using a maximum of two different symbols.at n=38A056476
• Number of primitive (aperiodic) palindromic structures using exactly two different symbols.at n=38A056481
• Number of subsets of {1, 2, ..., n} that do not contain a subset of the form {x, 2x, 3x}.at n=19A068060
• Jordan function J_9(n).at n=3A069094
• a(n) = Sum_{k=0..n} binomial(4*n,4*k).at n=5A070775
• Breadth-first-wise A014486-like encoding of A080299-trees.at n=19A080313
• Number of compositions of n with an odd number of 1's.at n=19A113980
• G.f.: 1/((1-2*x)*(1-2*x^2)).at n=17A122746
• 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=16A133212
• a(n) = n^6 - n^3.at n=8A136006
• Numbers in the array A137171.at n=42A137172
• Number of nX3 1..4 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order.at n=7A166832
• Difference of two positive 9th powers.at n=5A181128