16781312

Appears in sequences

• 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=25A005418
• Nonperiodic autocorrelation functions of length n.at n=25A006606
• Number of types of Boolean functions of n variables under a certain group.at n=11A028402
• Sums of 2 distinct powers of 8.at n=32A038484
• Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 1".at n=26A038504
• Number of elements of GF(2^n) with trace 1 and subtrace 1.at n=26A038521
• Expansion of 2*(1-x-x^2)/((1-2*x)*(1-2*x^2)).at n=24A052957
• Sums of two powers of 16.at n=24A055261
• a(-1) = 1; for n >= 0, a(n) = 2^n + 4^n = 2^n*(1 + 2^n).at n=13A063376
• Number of strings over Z_4 of length n with trace 0 and subtrace 0.at n=13A068620
• S(n; 0,1) = S(n; 2,3) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=13A068711
• S(n; 2,0) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4.at n=13A068789
• Number of strings of length n over GF(4) with trace 1 and subtrace 0.at n=13A073997
• Number of strings of length n over GF(4) with trace 1 and subtrace 1.at n=13A073998
• Number of compositions of n with an even number of 1's.at n=26A113979
• 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=25A120421
• 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=25A131885
• 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=22A133212
• Numbers such that the digital sums in base 2, base 4 and base 8 are all equal.at n=19A135124
• a(n) = 2^n + 4^n.at n=12A161168