844305

Appears in sequences

• Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n has exactly 6 distinct prime factors and n is squarefree.at n=8A071145
• a(n) is the LCM of the Jacobsthal sequence {J(1),...,J(n)}.at n=7A105611
• Products of 6 distinct odd primes.at n=32A168352
• A four product triangle sequence based on :a=2;f(n,a)=f(n - 1, a) + a*f(n - 2, a).at n=22A174187
• A four product triangle sequence based on :a=2;f(n,a)=f(n - 1, a) + a*f(n - 2, a).at n=26A174187
• a(n) = n*(n + 1)*(n + 2)*(4*n - 3)/6.at n=33A264851
• Irregular triangle read by rows: T(n,k), 2 <= n , 3 <= k <= largest k such that A067175(k) <= n , is the smallest n-digit number m such that omega(m) = A001221(m) = k, and its largest prime factor equals the sum of its remaining prime factors. or -1 if no such number exists.at n=13A383677
• a(n) is the least number k such that omega(k) = n and the largest prime factor of k equals the sum of its remaining prime factors, where omega(k) = A001221(k).at n=3A383725
• Square array read by ascending antidiagonals, where row n lists numbers m such that omega(m) = n and the largest prime factor of m equals the sum of its remaining distinct prime factors, where omega(m) = A001221(m).at n=6A383726