2592000

Appears in sequences

• Highly powerful numbers: numbers with record value of the product of the exponents in prime factorization (A005361).at n=37A005934
• Composite n added to sum of its prime factors is nextprime(n).at n=10A050765
• Array used for numerators of g.f.s for column sequences of array A090216 ((5,5)-Stirling2).at n=5A090222
• Square array T(n,k) read by antidiagonals: denominators of Stirling numbers of first kind with negative argument S1(-n,k), n,k>=0.at n=38A103880
• Denominators of the triangle of coefficients T(n,k), read by rows, that satisfy: y^x = Sum_{n=0..x} R_n(y)*x^n for all nonnegative integers x, y, where R_n(y) = Sum_{k=0..n} T(n,k)*y^k and T(n,k) = A107045(n,k)/a(n,k).at n=23A107046
• Numbers of the form (5^i)*(12^j), with i, j >= 0.at n=35A108201
• Number of base 28 n-digit numbers with adjacent digits differing by three or less.at n=7A126496
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k even entries that are followed by a smaller entry (n>=0, k>=0).at n=40A134434
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k odd entries that are followed by a smaller entry (n >= 0, k >= 0).at n=32A134435
• Number of different ways n! can be represented as the difference of two squares; also, for n >= 4, half the number of positive integer divisors of n!/4.at n=31A138196
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k adjacent pairs of the form (odd,even) (0<=k<=floor(n/2)).at n=37A145891
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k runs of odd entries (1<=k<=ceiling(n/2)). For example, the permutation 321756498 has 3 runs of odd entries: 3, 175 and 9.at n=34A152666
• Numbers n such that n = k/d(k) has exactly 5 solutions, where d(k) = number of divisors of k.at n=26A217126
• Denominators of poly-Cauchy numbers c_n^(4).at n=5A224098
• a(n) = [n/2]!*[(n+1)/2]!*C([n/2],1)*C([(n+1)/2],1).at n=10A226282
• T(n,k) = [n/2]!*[(n+1)/2]!*C([n/2],k-1)*C([(n+1)/2],k-1) where [x] = floor(x).at n=76A226288
• Discriminants of polynomials having Fibonacci numbers (A000045) for coefficients, P_n(x) = Sum_{k=1..n} F(k)*x^(2n-1-k) + Sum_{k=1..(n-1)} (-1)^k*F(n-k)*x^(n-k-1); a(1) = 1.at n=3A284637
• Numbers k with record values of the ratio d(k)/ud(k) between the number of divisors and the number of unitary divisors.at n=35A307870
• a(n) is the product of the Zumkeller divisors of n.at n=59A376882