101413

Appears in sequences

• Number of productions of a certain "divide-and-conquer" context-free grammar in Chomsky normal form that generates all permutations of n symbols.at n=12A092285
• a(1)=0; thereafter a(2k)=k+a(k), a(2k+1)=6k+4+a(6k+4).at n=26A270814
• a(n) is the smallest positive integer k with k != 10^m (m: nonnegative integer) for which 1/n can be obtained by incorrectly reducing k/(n*k) - by deleting the same digit in the numerator and denominator as often as possible, leaving one digit "1" in the numerator.at n=7A370911