8168160
domain: N
Appears in sequences
- a(n) = 30*(n+1)*binomial(n+4,10).at n=7A027806
- Partial sums of A034263.at n=31A051947
- Numbers that can be expressed as the difference of the squares of primes in exactly twenty-three distinct ways.at n=3A092019
- Numbers with exactly 7 distinct prime divisors {2,3,5,7,11,13,17}.at n=15A147574
- T(n,k)=Number of pairs of orthogonal (-x,y) vectors of length k*(x+y), where x/y is the n-th rational <= 1, ordered first by y and then x, e.g. 1/1, 1/2, 1/3, 2/3, 1/4, 3/4 ...at n=26A225987
- Number of pairs of orthogonal (-3,4) vectors of length 7*n.at n=1A225992
- Positions of records in A266342.at n=14A266343
- a(n) = (A000040(n)-1) * A002110(n).at n=6A286629
- a(n) = binomial(n+3, 3)*(1 + binomial(n+2, 3)/4).at n=31A291288
- Numbers n such that there exist exactly four distinct Pythagorean triangles, at least one of them primitive, with area n.at n=1A291420
- Semi-unitary highly composite numbers: where the number of semi-unitary divisors of n (A322483) increases to a record.at n=18A322484
- Integer areas of integer-sided triangles where the lengths of two of the sides are cubes.at n=22A329536
- Numbers m such that sigma(m)/esigma(m) > sigma(k)/esigma(k) for all k < m, where sigma(m) is the sum of divisors of m (A000203) and esigma(m) is the sum of exponential divisors of m (A051377).at n=14A335396
- 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=6A353875
- Numbers that are sparsely totient (A036913) and of least prime signature (A025487).at n=29A355475
- Numbers k with record values of the ratio A000005(k)/A049419(k) between the number of divisors of k and the number of exponential divisors of k.at n=9A361807
- Numbers k neither squarefree nor prime powers that are products of primorials such that A119288(k) <= k/A007947(k) < A053669(k).at n=19A369541
- Numbers k that have a record number of divisors d such that gcd(d, k/d) is a square.at n=13A377707
- Numbers that have a record number of (1+phi)-divisors (A061389).at n=24A377711
- Irregular triangle T(n,k) = P(n)*2^k, n >= 0, k = 0..floor(log_2 prime(k+1)), where P = A002110.at n=26A378133