174720

Appears in sequences

• Smallest k such that d(phi(k)) - phi(d(k)) = -n, where d(k) = A000005(k) and phi(k) = A000010(k).at n=24A078151
• Numbers that can be expressed as the difference of the squares of primes in exactly nine distinct ways.at n=23A092005
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 1, 0), (0, 1, 1), (1, 0, 0), (1, 0, 1)}.at n=8A151245
• a(n) is the smallest positive multiple k of n such that every length of the runs of 0's and 1's in the binary representation of k is coprime to n.at n=59A162537
• Numbers which are the area of exactly three Pythagorean triangles.at n=20A177021
• T(n,k) = Number of n-step self-avoiding walks on a k X k X k X k 4-cube summed over all starting positions.at n=33A188784
• Number of 6-step self-avoiding walks on an n X n X n X n 4-cube summed over all starting positions.at n=2A188789
• Number of -n..n arrays of 4 elements with zero sum and no two neighbors summing to zero.at n=31A199833
• Number of (n+2)X3 binary arrays avoiding patterns 000 and 010 in rows, columns and nw-to-se diagonals.at n=6A202485
• Number of (n+2)X9 binary arrays avoiding patterns 000 and 010 in rows, columns and nw-to-se diagonals.at n=0A202491
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 010 in rows, columns and nw-to-se diagonals.at n=21A202492
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 010 in rows, columns and nw-to-se diagonals.at n=27A202492
• (n-1)-st elementary symmetric function of the first n terms of (1,2,3,4,5,1,2,3,4,5,...)=A010884.at n=11A203166
• 8-quantum transitions in systems of N >= 8 spin 1/2 particles, in columns by combination indices.at n=23A213350
• Numbers n such that there are three distinct triples (k, k+n, k+2n) of squares.at n=9A222154
• Denominators of r(n) := Sum_{k=0..n-1} 1/Product_{j=0..4} (k + j + 1), for n >= 0, with r(0) = 0.at n=12A300299
• Unitary deficient-perfect numbers: unitary deficient numbers k such that 2*k-usigma(k) is a unitary divisor of k, where usigma is the sum of unitary divisors of k (A034448).at n=10A303356
• a(n) is the smallest number m with exactly n such divisors d that sigma(d) divides m.at n=39A309253
• Least value m > 0 such that Diophantine equation z^2 - y^2 - x^2 = m, when the positive integers, x, y and z are consecutive terms of an arithmetic progression, has exactly n solutions.at n=38A334567
• Numbers whose infinitary divisors have a mean infinitary abundancy index that is larger than 2.at n=13A374788