36540

Appears in sequences

• a(n) = floor(n(n-1)(n-2)(n-3)/18).at n=30A011928
• A049031/2.at n=37A049032
• Bessel polynomial {y_n}'''(-1).at n=5A065951
• Even numbers k such that the central binomial coefficient A000984(k, k/2) is divisible by k^2.at n=21A080395
• Least common multiple of {d-1: d > 1 and d divides n}.at n=29A084190
• a(n) = lcm(1,2,3,...,n) * (sum of Farey fractions of order n).at n=8A093627
• Triangle of numbers obtained from the partition array A134279.at n=31A134280
• Triangle of numbers obtained from the partition array A134279.at n=40A134280
• Number of permutations of 3 indistinguishable copies of 1..n arranged in a circle with exactly 2 adjacent element pairs in decreasing order.at n=5A151590
• a(n) is the number of convex pentagons in an n-triangular net.at n=15A176646
• Numbers with prime factorization pqrs^2t^2.at n=13A189989
• Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k edges; n >= 0, 0 <= k <= A002620(n).at n=37A228890
• Irregular triangular array read by rows: T(n,k) is the number of 2-colored simple labeled graphs on n nodes that have exactly k edges, 0<=k<=A002620(n), n>=1.at n=36A241669
• Number of ordered ways of writing n^2 as a sum of n nonnegative cubes.at n=10A298936
• a(n) is the smallest number k >= 1 with exactly n divisors d, for which sigma(k) is divisible by d*sigma(d).at n=18A344103
• Number of digraphs on n unlabeled nodes whose strongly connected components are directed cycles or single vertices.at n=6A361584
• Denominator of the asymptotic mean over the positive integers of the maximum exponent in the prime factorization of the largest prime(n)-smooth divisor function.at n=2A375539