91891800

Appears in sequences

• Exponential generating function: (1+3*x)/(1-2*x)^(7/2).at n=7A000457
• Members of A097212, excluding highly composite numbers (A002182).at n=17A097213
• Triangle of Ward numbers T(n,k) read by rows.at n=43A134991
• Triangle of Ward numbers T(n,k) (n>=0, k=0 if n=0, otherwise 0 <= k <= n-1) read by rows.at n=38A181996
• Triangle read by rows: T(0,0)=1; T(m,0)=0; otherwise T(m,n) = (m-1)*T(m-1,n)+(m-1+n)*T(m-1,n-1).at n=53A239098
• Table (read by rows) of all k-digit positive integers (in ascending order) with maximum number of divisors A066150(k).at n=21A240544
• If n is even then a(n) = n!/( 2^(n/2)*(n/2)! ), otherwise a(n) = n!/( 3*2^((n-1)/2)*((n-3)/2)! ).at n=15A259877
• Triangle read by rows, Ward numbers T(n, k) = Sum_{m=0..k} (-1)^(m + k) * binomial(n + k, n + m) * Stirling2(n + m, m), for n >= 0, 0 <= k <= n.at n=53A269939
• a(n) is the least positive integer divisible by exactly n primitive nondeficient numbers (A006039).at n=32A337691
• Integers whose number of divisors that are triangular numbers sets a new record.at n=29A350756
• Numbers with a record number of exponentially squarefree divisors.at n=34A365681
• Numbers that have more biquadratefree divisors than any smaller number.at n=29A377140
• Numbers k that have a record number of divisors d such that gcd(d, k/d) is an exponentially odd number (A268335).at n=29A377708
• Triangle T(n, k) read by rows: T(n, k) = 2^n*binomial(2*n + 1, 2*k + 1) * Pochhammer(1/2, n - k) * Pochhammer(1/2, k).at n=37A380281
• LCM of the denominators of the terms of the n-th row of the triangle defined by T(n,k) = (prime(n)-prime(k))/(prime(n)+prime(k)) for k=1 to n-1.at n=11A385099