4196352

Appears in sequences

• Numbers that are the sum of 2 positive 11th powers.at n=7A004813
• Numbers that are the sum of at most 2 positive 11th powers.at n=12A004908
• Numbers that are the sum of at most 3 positive 11th powers.at n=23A004909
• 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=23A005418
• Number of types of Boolean functions of n variables under a certain group.at n=10A028402
• 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=10A033840
• Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 0".at n=24A038503
• Number of elements of GF(2^n) with trace 0 and subtrace 1.at n=24A038519
• Number of 2n-bead balanced binary strings, rotationally equivalent to complement.at n=22A045654
• Expansion of 2*(1-x-x^2)/((1-2*x)*(1-2*x^2)).at n=22A052957
• a(-1) = 1; for n >= 0, a(n) = 2^n + 4^n = 2^n*(1 + 2^n).at n=12A063376
• a(n) = Sum_{k=0..n} binomial(4*n,4*k).at n=6A070775
• 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=11A071930
• (4^n+2^n+0^n+(-2)^n)/4.at n=12A083885
• Number of compositions of n with an even number of 1's.at n=24A113979
• a(2n) = a(n) + 2^(2n), a(2n+1) = 2^(2n+1).at n=22A129342
• 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=20A133212
• a(n) = 2^n + 4^n.at n=11A161168
• Number of binary necklaces of 2n beads for which a cut exists producing a palindrome.at n=22A185376
• Number of classes of endofunctions of [n] under reversal and complement to n+1.at n=8A275550