6915585600

Appears in sequences

• Define an array by d(m, 0) = 1, d(m, 1) = m; d(m, k) = (m - k + 1) d(m+1, k-1) - (k-1) (m+1) d(m+2, k-2). Sequence gives d(0,2n).at n=6A126934
• Square numbers with more divisors than any smaller square number.at n=24A136404
• Duplicate of A136404.at n=24A176471
• Number of 3 X n 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 1 1 vertically.at n=23A207929
• Exponential infinitary highly composite numbers: where the number of exponential infinitary divisors (A307848) increases to record.at n=7A306736
• Exponential unitary highly composite numbers: where the number of exponential unitary divisors (A278908) increases to a record.at n=7A307845
• Exponential highly composite numbers: where the number of exponential divisors of n (A049419) increases to a record.at n=19A318278
• Numbers that set records in A380032.at n=29A380033