42736

Appears in sequences

• Number of leftist trees with n leaves.at n=16A006196
• Let S denote the palindromes in the language {0,1}*; a(n) = number of words of length n in the language SS.at n=21A007055
• Number of 2n-bead balanced binary strings, rotationally equivalent to reverse, complement and reversed complement.at n=21A045656
• Series reversion of g.f. A(x) is -A(-x).at n=15A089796
• Number of bits in A127962(n).at n=29A127965
• Number of permutations of length n which avoid the patterns 321 and 1324.at n=22A179257
• Number of binary strings of length n having a cyclic shift that is a palindrome.at n=21A245582
• Lexicographically earliest sequence of positive integers such that for any n > 0, the binary expansion of a(n) contains the binary expansion of k for k = 1..n and the binary expansion of a(n+1) is obtained by replacing a possibly empty substring of the binary expansion of a(n) by the binary expansion of n+1.at n=15A344184