36690
domain: N
Appears in sequences
- Number of peaks in all hill-free Dyck paths of semilength n (a Dyck path is hill-free if it has no peaks at level 1).at n=10A114515
- Array of coefficients of powers of x^2 for (S(2*n+1,x)/x)^3, with Chebyshev's S polynomials A049310.at n=26A220665
- Numbers n for which number of iterations to reach the largest equals number of iterations to reach 1 from the largest in Collatz (3x+1) trajectory of n.at n=36A224303
- Triangle read by rows: T(n,k) is the number of weighted lattice paths B(n) having k uHd strings.at n=52A247292
- Triangle read by rows: T(n,k) = number of noncrossing path sets on n nodes up to rotation with k paths and isolated vertices allowed.at n=59A303869