9174400

Appears in sequences

• Let S denote the palindromes in the language {0,1}*; a(n) = number of words of length n in the language SS.at n=35A007055
• Number of 2n-bead balanced binary strings, rotationally equivalent to reverse, complement and reversed complement.at n=35A045656
• Number of binary strings of length n having a cyclic shift that is a palindrome.at n=35A245582
• E.g.f. S(x) = Integral C(x) * C(S(x)) dx, such that C(x)^2 - S(x)^2 = 1, where S(x) = Sum_{n>=0} a(n)*x^(2*n+1)/(2*n+1)!, with coefficients a(n) starting at n = 0.at n=5A322895
• E.g.f. A(x) = C(x) + S(x) = exp( Integral C(S(x)) dx ) such that C(x)^2 - S(x)^2 = 1, where A(x) = Sum_{n>=0} a(n)*x^n/n!, with coefficients a(n) starting at n = 0.at n=11A322897