2098176

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=23A000749
• a(n) = (2^n + 2^[ n/2 ] )/2.at n=20A001445
• a(n) = 2^(n-1)*(2^n - (-1)^n).at n=11A003674
• Numbers that are the sum of 3 nonzero 10th powers.at n=17A004803
• Numbers that are the sum of at most 3 nonzero 10th powers.at n=32A004898
• 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=22A005418
• Nonperiodic autocorrelation functions of length n.at n=22A006606
• a(n) = 2^(n-1)*(1+2^n).at n=11A007582
• Sum of every 4th entry of row n in Pascal's triangle, starting at "n choose 0".at n=23A038503
• Number of elements of GF(2^n) with trace 0 and subtrace 0.at n=23A038518
• Number of elements of GF(2^n) with trace 1 and subtrace 1.at n=23A038521
• 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=21A051437
• Triangular numbers whose digits can be rearranged to form a substring of 123456789012345678901234....at n=35A068804
• Numbers which do not appear prematurely in the binary Champernowne word (A030190).at n=32A083655
• a(n) = Sum_{k=0..n} binomial(4n+3,4k).at n=5A090408
• Number of compositions of n with an odd number of 1's.at n=22A113980
• 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=22A120421
• a(2n) = 2^(2n), a(2n+1) = 2^(2n+1) + a(n).at n=21A127804
• Duplicate of A038521.at n=23A134654
• A006516 at positions with even indices, A007582 at positions with odd indices.at n=23A137173