78369
domain: N
Appears in sequences
- The number of n-almost primes less than or equal to 8^n, starting with a(0)=1.at n=7A116428
- Consider the array T(r,c), the number of c-almost primes less than or equal to r^c. This is the diagonal T(r,r-1).at n=7A116434
- Binomial transform of [1, 3, 4, 3, 2, 0, 0, 0, ...].at n=31A136395
- a(n) = d if the point (d,d) is shared by a record of different Dyck paths in the main diagonal of the diagram of the symmetries of sigma described in A237593.at n=20A279286
- a(n) is the smallest number d if the point (d,d) is shared by exactly n different Dyck paths in the main diagonal of the diagram of the symmetries of sigma described in A237593.at n=21A282197
- G.f. A(x) satisfies: 1 = Sum_{n>=0} x^n * ((1+x)^(2*n) - A(x))^(n+1), where A(0) = 0.at n=7A307952
- Number of integer compositions of n with all distinct even-indexed parts and all distinct odd-indexed parts.at n=25A351018