2998800

Appears in sequences

• Number of rooted connected graphs on n labeled nodes where the root has degree 2.at n=4A038095
• Triangle read by rows: T(n, k) = binomial(2*n+1, n-k)^2*(2*k+1)/(2*n+1).at n=40A067802
• Numbers k with record values of the ratio A000005(k)/A246600(k) between the total number of divisors of k and the number of divisors d of k such that the bitwise OR of k and d is equal to k.at n=30A361937
• Terms of A363690 with a record number of divisors.at n=31A363692