218243025

Appears in sequences

• a(n) = (2*n + 3)!!/3 = A001147(n+2)/3.at n=8A051577
• Second Eulerian transform of 1, 2, 3, 4, 5, ... (A000027).at n=9A102147
• Oddly colossally abundant numbers.at n=9A110464
• Oddly superabundant numbers: odd n with sigma(n)/n > sigma(k)/k for all odd k < n.at n=28A119239
• Smallest odd number with same number of divisors as 3*a(n-1).at n=21A140864
• Numbers with exactly 7 distinct odd prime divisors {3,5,7,11,13,17,19}.at n=16A147580
• Products of the first terms of the arithmetic sequence f(n) defined by f(2^k l) = l^{1 - k} (for k a nonnegative integer and l a positive odd integer).at n=18A185275
• Triangle T(n,k): the coefficient [x^(n-k)] of the polynomial 2^n*n!*L(n,3/2,x), where L is the generalized Laguerre Polynomial in the Abramowitz-Stegun normalization.at n=44A229789
• Column 1 of the triangular array at A249057.at n=16A249060
• Number of permutations of [n] having exactly eight nontrivial cycles.at n=1A289956
• Number of linear chord diagrams having n chords and no chord length larger than nine.at n=10A294001
• Numbers that are not practical (A237287) and have more divisors than any smaller number that is not practical.at n=31A335029
• Positions of records in A188169.at n=28A343134
• Positions of records in A188170.at n=27A343135
• Positions of records in A188171.at n=26A343136
• Positions of records in A188172.at n=26A343137
• a(n) = n*(n+2)*(n+4)*(n+6)*(n+8)*(n+10)*(n+12)*(n+14).at n=5A346515
• a(n) is the smallest odd number that has n middle divisors.at n=29A354385
• Triangle read by rows, T(n, k) = 4^k * Gamma(n + k + 1/2) / Gamma(n - k + 1/2).at n=25A362847