117001

Appears in sequences

• Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k hills (i.e., ud's starting at level 0). (A Grand Motzkin path is a path in the half-plane x>=0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).).at n=49A109191
• Number of Grand Motzkin paths of length n and having no hills (i.e., no ud's starting at level 0). (A Grand Motzkin path of length n is a path in the half-plane x >= 0, starting at (0,0), ending at (n,0) and consisting of steps u=(1,1), d=(1,-1) and h=(1,0).)at n=13A109192
• Number of binary strings of length n with equal numbers of 00100 and 01101 substrings.at n=18A164238
• a(n) = 1 + 2*n + n^2 + 2*n^3 + n^4.at n=18A165563
• a(2n)=A165568(n). a(2n+1)=A165563(n).at n=37A171733
• Composites in base 10 that remain composite in exactly four bases b, 2 <= b <= 10, expansions interpreted as decimal numbers.at n=29A256354
• a(n) = numerator of Sum_{d|n} (d/pod(d)) where pod(k) = the product of the divisors of k (A007955).at n=29A324505