55080

Appears in sequences

• a(n) = (n+1)*binomial(n+1,4).at n=14A027764
• a(n) = (n+1)*binomial(n+1,14).at n=4A027774
• Saint-Exupéry numbers: ordered products of the three sides of Pythagorean triangles.at n=21A057096
• Least k such that Sum_{i=1..k} gcd(k,i) = n * sigma(k).at n=8A072108
• Numbers with prime factorization pqr^3s^4.at n=14A190294
• Number of zero trace primitive elements in Galois field GF(3^n).at n=11A192212
• Number of 2 X 2 matrices with entries in {0,1,...,n} and even trace with no entries repeated.at n=19A280056
• Numbers m such that sigma(m)*tau(m) is a square but sigma(m)/tau(m) is not an integer.at n=17A327831
• a(n) is the number of subsets of {1..n} that contain exactly 4 odd and 1 even numbers.at n=36A333320
• a(n) is the number of subsets of {1..n} that contain exactly 1 odd and 4 even numbers.at n=36A333321
• Consider all 3 X 3 matrices M whose entries are the n-th to (n+8)-th primes prime(n), ..., prime(n+8), in any order. a(n) is the sum of the number of M such that det(M) is divisible by prime(n+i), for i from 0 to 8.at n=13A339105
• Numbers k >= 1 such that A018804(k) divided by A000203(k) is an integer.at n=24A349726
• a(n) is the smallest number with exactly n divisors that are hoax numbers (A019506).at n=8A357034
• a(n) is the smallest integer k whose set of divisors contains exactly n triples (x,y,z) of distinct divisors considered as integer-sided triangles with integer areas, or 0 if no such k exists.at n=28A377418
• a(n) = Sum_{k=0..floor(n/3)} binomial(3*k,3*(n-3*k)).at n=23A391904