19550

Appears in sequences

• Row sums of A075652.at n=22A075650
• Fifth column (m=4) of (1,3)-Pascal triangle A095660.at n=22A095661
• Triangle read by rows: T(n,k) is the number of hill-free Schroeder paths of length 2n that have k weak ascents (1<=k<=n-1 for n>=2; k=1 for n=1). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A hill is a peak at height 1. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.at n=33A114691
• Partial sums of economical numbers A046759.at n=19A172460
• Number of (n+1) X (n+1) -2..2 symmetric matrices with every 2 X 2 subblock having sum zero and two or three distinct values.at n=11A211115
• Number of standard Young tableaux of shape [3n,3].at n=16A215543
• a(n) = pg(n, 3) + pg(n, 4) + ... + pg(n, n) where pg(n, m) is the m-th n-th-order polygonal number.at n=19A245679
• Expansion of Product_{k>=1} (1 - x^(4*k))^(4*k) / (1 - x^k)^k.at n=19A285215
• The smallest of 3 consecutive integers such that the first is divisible by the square of a prime, the second is divisible by the cube of a prime, and the third is divisible by the fourth power of a prime.at n=10A349952
• Number of permutations of size n which are both two-clumped and co-two-clumped.at n=8A375923
• Numbers m such that the product m*(m+1) has a set of prime divisors, from greatest down to 2, that is missing exactly two prime divisors.at n=46A391970