1049600

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=22A000749
• Numbers that are the sum of 2 nonzero 10th powers.at n=7A004802
• Numbers that are the sum of at most 2 nonzero 10th powers.at n=12A004897
• Numbers that are the sum of at most 3 nonzero 10th powers.at n=23A004898
• 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=21A005418
• Nonperiodic autocorrelation functions of length n.at n=21A006606
• Number of types of Boolean functions of n variables under a certain group.at n=9A028402
• Number of elements of GF(2^n) with trace 1 and subtrace 0.at n=22A038520
• Number of 2n-bead balanced binary necklaces which are equivalent to their reverse, complement and reversed complement.at n=42A045674
• Expansion of 2*(1-x-x^2)/((1-2*x)*(1-2*x^2)).at n=20A052957
• a(-1) = 1; for n >= 0, a(n) = 2^n + 4^n = 2^n*(1 + 2^n).at n=11A063376
• a(n) = n^2*(n^2+1).at n=32A071253
• Inverse modulo 2 binomial transform of 3^n.at n=13A100736
• Number of compositions of n with an even number of 1's.at n=22A113979
• 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=21A120421
• First differences of A137776.at n=44A138569
• a(n) = 2^n + 4^n.at n=10A161168
• Number of binary necklaces of 2n beads for which a cut exists producing a palindrome.at n=20A185376
• Recurrence a(n) = a(n-2) + n^M for M=10, starting with a(0)=0, a(1)=1.at n=4A231309
• If 2*n = Sum (2^e_k) then a(n) = Sum (e_k^n).at n=9A309801