57967

Appears in sequences

• The start of a record-breaking run of consecutive integers with a number of prime factors (counted with multiplicity) equal to 5.at n=3A067820
• Numbers of the form (7^i)*(13^j).at n=17A108056
• Numbers that factorize into a prime number of factors all raised to different prime exponents and no number appears both as an exponent and as a prime factor.at n=17A114131
• Numbers k such that k, k+1, k+2 and k+3 are products of 5 primes.at n=0A124729
• Positive numbers y such that y^2 is of the form x^2+(x+343)^2 with integer x.at n=24A157246
• Successive integers produced by Conway's PRIMEGAME using Kilminster's Fractran program with only nine fractions.at n=22A183132
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 539", based on the 5-celled von Neumann neighborhood.at n=38A272803
• Numbers k such that (29*10^k + 673)/9 is prime.at n=22A293825
• Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = sqrt( Product_{a=1..n} Product_{b=1..k-1} (4*sin((2*a-1)*Pi/(2*n))^2 + 4*sin(2*b*Pi/k)^2) ).at n=42A341738
• Numbers of the form (q1^b1)(q2^b2)(q3^b3)(q4^b4)(q5^b5)... where q1=7, q2=13, q3=19, q4=31, q5=37, ... (A002476) and b1>=b2>=b3>=b4>=b5...at n=14A344473
• If F is the Fermat point of a triangle ABC with A < B < C < 2*Pi/3, where AB, BC, CA, FA, FB and FC are all positive integers, then, this sequence gives the sum FA + FB + FC when gcd(a, b, c) = A351477(n).at n=14A351476
• a(n) is the smallest number m such that m, m+1, m+2 and m+3 each have exactly n prime factors (counted with multiplicity).at n=2A356893
• Starts of runs of 3 consecutive integers that are divisible by the cube of their least prime factor.at n=6A365868
• Powerful numbers whose prime factors are all of the form 3*k + 1.at n=36A369565
• Triangle read by rows: T(m,k) is the first number that starts a sequence of exactly k consecutive numbers with m prime factors, counted with multiplicity, if such a sequence is possible.at n=30A374449
• Square array T(n, k), n >= 2 and k >= 1, read by antidiagonals in ascending order, give the smallest number that starts a sequence of exactly k consecutive numbers each having exactly n prime factors (counted with multiplicity), or -1 if no such number exists.at n=24A375160
• Powerful numbers k that are not prime powers such that there exist no numbers m such that rad(m) | k and Omega(m) > Omega(k), where rad = A007947 and Omega = A001222.at n=21A377591
• Numbers whose prime indices have more than one permutation with all equal run-sums.at n=41A383015
• Odd Achilles numbers.at n=38A390953