336140

Appears in sequences

• a(n) = smallest number m such that for all k > m, either k or k+1 has a prime factor > prime(n).at n=6A002072
• Numbers whose digital sum is equal to the sum of primes from their smallest to largest prime factor.at n=33A076406
• a(n) = product of terms in row n of Pascal's triangle (A001142) divided by n^k, where n^k is the largest power of n dividing it.at n=7A109873
• Numbers k such that both k and k + 1 are logarithmically smooth.at n=14A116486
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+16807)^2 = y^2.at n=22A118576
• a(n) = n*(n-1)*7^n.at n=4A128801
• Largest number x such that x and x+1 are prime(n)-smooth but not prime(n-1)-smooth.at n=6A145606
• Integers n such that for all i > n the largest prime factor of i*(i+1) exceeds the largest prime factor of n*(n+1).at n=6A193943
• The largest prime factor of n*(n+1) equals 17. (Related to the abc conjecture.)at n=39A252492
• The 108 numbers n such that n(n+1) is 17-smooth.at n=107A275156
• Terms of A301517 that are not exponentially odd numbers (A268335).at n=29A335989
• Numbers which are sum of three squares of positive numbers and also 5 times of the sum of their joint products.at n=25A347969
• Triangle read by rows: T(n,k) is the number of forests of labeled rooted hypertrees with n vertices and weight k, 0 <= k < n.at n=23A364709
• Numbers m such that the product m*(m+1) has a set of prime divisors, from greatest down to 2, that is missing exactly one prime divisor.at n=45A391885