134225920

Appears in sequences

• a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3), n > 3, with a(0)=a(1)=a(2)=0, a(3)=1.at n=29A000749
• a(n) = (2^n + 2^[ n/2 ] )/2.at n=26A001445
• a(n) = (4^n + 4^[ n/2 ] )/2.at n=12A001446
• a(n) = 2^(n-1)*( 2^n + (-1)^n ).at n=14A003665
• Number of (n-1)-bead black-white reversible strings; also binary grids; also row sums of Losanitsch's triangle A034851; also number of caterpillar graphs on n+2 vertices.at n=28A005418
• Nonperiodic autocorrelation functions of length n.at n=28A006606
• a(n) = 2^(n-1)*(1+2^n).at n=14A007582
• a(n) = 4^n*(4^n+1)/2.at n=7A026244
• Number of reversible strings with n beads of 4 colors.at n=14A032121
• Sum of every 4th entry of row n in Pascal's triangle, starting at binomial(n,2).at n=29A038505
• Number of elements of GF(2^n) with trace 0 and subtrace 1.at n=29A038519
• Number of elements of GF(2^n) with trace 1 and subtrace 1.at n=29A038521
• Number of undirected walks of length n+1 on an oriented triangle, visiting n+2 vertices, with n "corners"; the symmetry group is C3. Walks are not self-avoiding.at n=27A051437
• a(n) is the number of rotation-reflection inequivalent solutions to the all-ones lights out problem on an n X n square.at n=46A075463
• Number of compositions of n with an odd number of 1's.at n=28A113980
• Number of distinct ribbon Schur functions with n boxes; also the number of distinct multisets of partitions determined by all coarsenings of compositions of n.at n=28A120421
• A006516 at positions with even indices, A007582 at positions with odd indices.at n=29A137173
• a(n) = n^7*(n^7 + 1)/2.at n=4A168664
• Triangular numbers representable as 2^x + 2^y.at n=15A262242
• Number of degree n polynomials f with all nonzero coefficients equal to 1 such that f(k) is divisible by 4 for all integers k.at n=31A309846