33592

Appears in sequences

• Strict sense ballot numbers: n candidates, k-th candidate gets k votes.at n=6A003121
• Expansion of (1-4*x)^(19/2).at n=11A020931
• Fibonacci sequence beginning 0, 13.at n=18A022347
• Dirichlet convolution of Catalan numbers with themselves.at n=10A034768
• Composite binary rooted trees with external nodes.at n=20A035102
• a(n) is the difference between maximal and central squarefree kernel numbers dividing values of {binomial(n,k)} or A001405(n), respectively.at n=19A048682
• Third diagonal of array in A059347.at n=19A059348
• Numbers n such that phi(n+2) - 2*phi(n+1) + phi(n) = -n.at n=3A066348
• a(1) = 1. a(n) = n*a(n-1) if gcd(n,a(n-1)) = 1, a(n-1)/n if n divides a(n-1), otherwise a(n) = a(n-1).at n=21A068629
• Expansion of (1 + x*C)*C, where C = (1 - (1 - 4*x)^(1/2))/(2*x) is the g.f. for Catalan numbers, A000108.at n=10A068875
• Duplicate of A003121.at n=5A083568
• Array A(x,y) giving the position of the y-th x in A007001 listed by rising antidiagonals.at n=56A085180
• Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A089864.at n=22A089408
• Inverse of binomial transform of Whitney triangle.at n=55A097761
• Expansion of exp( arcsinh( -2*x ) ) in powers of x.at n=22A104624
• Self-convolution of repeated Catalan numbers.at n=19A104722
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that cross the x-axis k times (n>=1, k>=0).at n=45A118920
• Expansion of exp( arcsinh( 2*x ) ).at n=22A182122
• Number of 3-step knight's tours on an (n+2) X (n+2) board summed over all starting positions.at n=24A186852
• Expansion of 1/((1-x)^2*(1-x^2)^3*(1-x^3)^2*(1-x^4)).at n=25A210068