307836

Appears in sequences

• Number of (1,0) steps in all Grand Motzkin paths of length n.at n=11A109188
• Triangle read by rows: T(n,k) is the number of paths in the right half-plane from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k H=(2,0) steps (0 <= k <= floor(n/2)).at n=50A132885
• Numbers n such that sigma(Rev(phi(n))) = phi(Rev(sigma(n))), where sigma is the sum of divisors and phi the Euler totient function.at n=33A252255