169869312

Appears in sequences

• Dan numbers: numbers m of the form 2^j * 3^k such that m +- 1 are twin primes.at n=16A027856
• Duplicate of A027856.at n=16A059961
• Composites of form prime+1 containing a record number of prime factors.at n=19A066617
• Smallest k-almost prime between twin primes (for k >= 2).at n=23A068525
• Let M_n be the n X n matrix m(i,j) = min(prime(i), prime(j)); then a(n) = det(M_n).at n=16A070323
• Partial product of prime gaps: a(n) = a(n-1)*(prime(n+1) - prime(n)).at n=16A081411
• a(n) = the least number which is the average of two consecutive primes and has exactly n prime factors (counted with multiplicity).at n=23A092576
• a(n) is the least k with n prime factors (counting multiplicity) such that the sum of these n factors divides k. First member of A036844 with n prime factors.at n=24A104465
• Row sums of triangle A128182.at n=22A128183
• a(n) = (n^3 - n^2)*4^n.at n=8A128987
• List of pairs (a(n),b(n)): a(n) = prime(n) - prime(n-1) + a(n-1); b(n) = (prime(n) - prime(n-1))*b(n-1).at n=37A154279
• Numbers expressible as A*B^A in two or more different ways, with A, B > 1.at n=19A171606
• a(n) = 648 * n^6.at n=8A185270
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 358", based on the 5-celled von Neumann neighborhood.at n=28A287785
• Numbers of multiplicative persistence 5 which are themselves the product of digits of a number.at n=22A350184
• 3-full numbers (A036966) sandwiched between twin primes.at n=23A360840
• 4-full numbers (A036967) sandwiched between twin primes.at n=6A360841
• a(n) = Product_{p in Factors(n)} mult(p) * n^mult(p) / p, where Factors(n) is the integer factorization of n and mult(p) the multiplicity of the prime factor p.at n=47A363917
• a(n) = Product_{k=2..n-1} k^ord(n, k) where ord(n, k) = 0 if k does not divide n, otherwise is the exponent of the highest power of k that divides n.at n=47A381885