2147516416

Appears in sequences

• a(n) = (4^n + 4^[ n/2 ] )/2.at n=14A001446
• a(n) = 2^(n-1)*( 2^n + (-1)^n ).at n=16A003665
• 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=32A005418
• a(n) = 2^(n-1)*(1+2^n).at n=16A007582
• a(n) = 4^n*(4^n+1)/2.at n=8A026244
• Number of reversible strings with n beads of 4 colors.at n=16A032121
• Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 0".at n=33A038503
• Number of elements of GF(2^n) with trace 0 and subtrace 0.at n=33A038518
• Number of relations with 5 arguments on n nodes.at n=1A051241
• 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=31A051437
• Numbers k such that k - 1 | sigma(k).at n=5A055708
• Numbers k such that k | sigma(k) + 2.at n=5A056006
• Numbers of the form n(n+1)/2 whose only representation as a sum of 2 or more consecutive positive integers is 1+2+...+n.at n=10A068195
• a(n) = (n^8 + n^4)/2.at n=16A071231
• a(n) = Sum_{k = 0..n} C(4*n + 1, 4*k).at n=8A090407
• Number of compositions of n with an odd number of 1's.at n=32A113980
• A006516 at positions with even indices, A007582 at positions with odd indices.at n=33A137173
• a(n) = n^8*(n^8 + 1)/2.at n=4A170780
• Numbers m whose deficiency is 2: sigma(m) - 2*m = -2.at n=4A191363
• Deficient numbers with increasing abundancy without being powers of 2.at n=22A228450