8390656

Appears in sequences

• a(n) = (2^n + 2^[ n/2 ] )/2.at n=22A001445
• a(n) = (4^n + 4^[ n/2 ] )/2.at n=10A001446
• a(n) = 2^(n-1)*( 2^n + (-1)^n ).at n=12A003665
• Numbers that are the sum of 3 positive 11th powers.at n=17A004814
• 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=24A005418
• a(n) = 2^(n-1)*(1+2^n).at n=12A007582
• a(n) = 4^n*(4^n+1)/2.at n=6A026244
• Number of reversible strings with n beads of 4 colors.at n=12A032121
• Dirichlet convolution of powers of 2 (2,4,8,...) with themselves.at n=20A034713
• Triangle read by rows: T(n,k) is the number of groupoids with n elements and k idempotents.at n=13A038018
• Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 0".at n=25A038503
• Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 1".at n=25A038504
• Number of elements of GF(2^n) with trace 0 and subtrace 0.at n=25A038518
• Number of elements of GF(2^n) with trace 1 and subtrace 0.at n=25A038520
• 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=23A051437
• a(n) = (n^8 + n^4)/2.at n=8A071231
• a(n) = (n^6 + n^3)/2.at n=16A071232
• a(n) = (n^12 + n^6)/2.at n=4A071235
• Numbers which do not appear prematurely in the binary Champernowne word (A030190).at n=35A083655
• a(n) = Sum_{k = 0..n} C(4*n + 1, 4*k).at n=6A090407