19420

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=19A007055
• Number of 2n-bead balanced binary strings, rotationally equivalent to reverse, complement and reversed complement.at n=19A045656
• Numbers k such that k+1, k+3, k+7 and k+9 are all primes.at n=18A125855
• a(n) = 12*a(n-1) - 34*a(n-2) for n > 1; a(0) = 1, a(1) = 7.at n=5A163458
• Number of (n+2) X 3 binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=7A202525
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=28A202532
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=35A202532
• Triangle of coefficients of polynomials v(n,x) jointly generated with A209773; see the Formula section.at n=50A209774
• Numbers m such that m+1, m+3, m+7, m+9 and m+13 are all primes.at n=5A245304
• Number of binary strings of length n having a cyclic shift that is a palindrome.at n=19A245582
• Numbers k such that A090086(k), the smallest pseudoprime to base k (not necessarily exceeding k), is a Carmichael number.at n=29A293203