141584
domain: N
Appears in sequences
- Triangle read by rows: coefficients d(n,k) of André polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.at n=34A094503
- Triangle read by rows: T(n,k) = (k+1)*T(n-1,k) + (n-k+1)*T(n,k-1).at n=25A096078
- Triangle read by rows: number of simsun n-permutations with k descents.at n=33A113897
- In the "3x+1" problem, let 0 denote a halving step and 1 denote an x->3x+1 step. Then a(n) is obtained by writing the sequence of steps needed to reach 1 from 2n+1 and reading it as a decimal number.at n=14A125710
- Increasing binary trees having exactly two vertices with outdegree 1.at n=4A131638