875160

Appears in sequences

• a(n) = 4*(2n+1)!/n!^2.at n=8A002011
• a(n) = (n+1)*binomial(n+1, 9).at n=9A027769
• a(n) = binomial(2n,n)*n*(2n+1)/2.at n=8A051133
• Array read by rows: T(n,k) = binomial(n+k-2,k-1)*binomial(2*n-1,n-k).at n=41A091811
• a(n) = C(n+2,2)*C(n,floor(n/2)).at n=15A107231
• Sum of squared terms in rows of triangle A152547: a(n) = Sum_{k=0..C(n,[n/2])-1} A152547(n,k)^2.at n=17A152548
• Triangle T(n, k) = (2*n+1)!! * 2^(1 + floor(n/2) + floor(k/2) + floor((k-1)/2)) * Beta(floor(n/2) + floor((k-1)/2) + 2, floor((n-1)/2) + floor(k/2) + 2), read by rows.at n=28A158867
• Triangle T(n, k) = (2*n+1)!! * 2^(floor((n-1)/2) + floor(k/2) + 1) * Beta(floor(n/2) + floor((k-1)/2) + 2, floor((n-1)/2) + floor(k/2) + 2), read by rows.at n=28A158868
• Numbers with prime factorization pqrst^2u^3.at n=17A190390
• Triangle read by rows: T(n,k) (n>=2, 1<=k<=n-1) is the number of unordered pairs of vertices at distances k in the odd graph O_n.at n=29A228308
• a(n) = n*binomial(n, n/2) if n is even otherwise 2^(n-1)*binomial(n-1, (n-1)/2).at n=18A389423