260337
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of cycle-up-down permutations of {1,2,...,n} having k cycles (1<=k<=n).at n=60A186366
- Sum of the lengths of the first ascents in all n-length left factors of Dyck paths.at n=18A191782
- E.g.f. A(x) satisfies differential equation A'''(x)=A(x)+A(x)^2, A(0)=0, A'(0)=1, A''(0)=1, A'''(0)=1.at n=14A199882
- Numbers n such that n and n+1 both have 32 divisors.at n=29A274807
- First term of n-th difference sequence of (round(k*sqrt(6))), k >= 0.at n=20A325843