49561

Appears in sequences

• Let S denote the palindromes in the language {0,1,2,...,n-1}*; a(n) = number of words of length 4 in the language SS.at n=28A187277
• Number of nX6 0..1 arrays with rows, diagonals and antidiagonals unimodal.at n=3A223667
• T(n,k)=Number of nXk 0..1 arrays with rows, diagonals and antidiagonals unimodal.at n=39A223669
• Number of 4Xn 0..1 arrays with rows, diagonals and antidiagonals unimodal.at n=5A223671
• Number of binary strings of length n+10 such that the smallest number whose binary representation is not visible in the string is 10.at n=9A261475
• Let p(n) be the n-th composite squarefree number. a(n) is the smallest integer q that forms a pure idempotent product.at n=19A325945