98017920

Appears in sequences

• a(n) = (n+10)!/10!.at n=7A051431
• Group the natural numbers into clumps with increasing prime numbers of elements, then multiply the members of each clump.at n=3A078423
• a(n) is the number of digraphs (not allowing loops) with vertices 1,2,...,n that have a unique Eulerian tour (up to cyclic shift).at n=7A102693
• a(n) = (n+1)(n+2)...(n+prime(k)) where prime(k) <= n < prime(k+1).at n=8A110423
• Products of 7 consecutive integers.at n=17A159083
• Members of A025487 whose prime signature is self-conjugate (as a partition).at n=23A181825
• (3n)!/[3n*n!*(n+1)!].at n=5A205824
• Table (read by rows) of all k-digit positive integers (in ascending order) with maximum number of divisors A066150(k).at n=22A240544
• Number of permutations of [n] beginning with at least ceiling(n/2) ascents.at n=17A262034
• a(n) is the least k such that A213636(k) = n.at n=16A326778
• a(n) = (n + A332558(n))!/(n-1)!.at n=10A332560
• Resistance values R < 1 ohm, multiplied by a common denominator 232792560 (= A338600(7)), that can be obtained from a network of exactly 7 one-ohm resistors, but not from any network with fewer than 7 one-ohm resistors.at n=17A338607
• a(n) is the minimal n-digit number which can be the length of a side of a Pythagorean triangle in the largest number of ways.at n=7A353875
• Positive integers whose maximum frequency in a fixed row of A036038 (or A078760) is equal to 3, i.e., numbers m such that A376663(m) = 3.at n=23A376670