268451840

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=30A000749
• 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=29A005418
• Number of types of Boolean functions of n variables under a certain group.at n=13A028402
• Smallest number > 1 equal to sum of n-th powers of its base-8 digits, or 0 if no such number exists (written in base 10).at n=13A033840
• Number of elements of GF(2^n) with trace 1 and subtrace 0.at n=30A038520
• Expansion of 2*(1-x-x^2)/((1-2*x)*(1-2*x^2)).at n=28A052957
• a(-1) = 1; for n >= 0, a(n) = 2^n + 4^n = 2^n*(1 + 2^n).at n=15A063376
• Sum of even entries in row n of Pascal's triangle.at n=29A088504
• Number of compositions of n with an even number of 1's.at n=30A113979
• a(n) = 2^n + 4^n.at n=14A161168
• Number of binary necklaces of 2n beads for which a cut exists producing a palindrome.at n=28A185376
• 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=32A309846
• Oblong numbers of the form 2^k*(2^k - 1) or 2^k*(2^k + 1).at n=27A390325