38262

Appears in sequences

• Triangle read by rows: T(n,k) is the number of Motzkin paths of length n with k peaks (n>=0, 0<=k<=floor(n/2)).at n=58A097860
• Differences between the prime-counting function and Gauss's approximation for number of primes < 10^n.at n=11A106313
• Not appropriate for the OEIS.at n=0A248690
• G.f. satisfies A(x) = (1 + x*A(x)) * (1 + x*A(x)^6).at n=5A364340
• Number of binary partitions of n into three kinds of parts.at n=20A373309
• Number of integer partitions of n having no permutation with all equal run-lengths.at n=48A382915