72338
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and have k triple descents (i.e., ddd's).at n=40A108443
- Expansion of 1/(1 - Sum_{k>=2} floor(1/omega(k))*x^k), where omega(k) is the number of distinct prime factors (A001221).at n=27A280195
- Number of compositions (ordered partitions) of n into parts with an odd number of distinct prime divisors.at n=27A286224
- Number of compositions (ordered partitions) of n into parts having the same number of distinct prime divisors as n.at n=27A301332
- Number of perfect squares in the half-open interval [Pi^(n-1), Pi^n).at n=21A306604