930930

Appears in sequences

• Denominator of (2n+1) B_{2n}, where B_n are the Bernoulli numbers.at n=30A006955
• Denominator of (n+1)*Bernoulli(n).at n=60A050932
• Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,67.at n=24A065701
• Triangular numbers containing 2n digits obtained by duplicating the first n digits; i.e., triangular numbers in A020338.at n=11A068899
• Let omega(m) be the number of distinct prime divisors of m. Then a(n) is the largest n-digit squarefree number such that omega(n) > omega(j) for all j < n.at n=5A074112
• Duplicate of A076978.at n=17A074168
• Smallest triangular number with n prime factors (counted without multiplicity).at n=7A076551
• Product of the distinct primes dividing the product of composite numbers between consecutive primes.at n=17A076978
• Product of all distinct prime factors of all composite numbers between n-th prime and next prime.at n=16A079615
• Triangular numbers using only the curved digits 0, 3, 6, 8 and 9.at n=28A079653
• Largest n-digit number with maximal number of distinct prime divisors.at n=5A091800
• Values of z arising from representations of n >= 11 in A085514.at n=26A102777
• a(n) = denominator(Bernoulli(prime(n) - 1))/prime(n).at n=17A110936
• Partial sums of dodecahedral numbers (A006566).at n=30A116689
• Triangular numbers composed of digits {0,3,9}.at n=8A119069
• Products of 7 distinct primes (squarefree 7-almost primes).at n=7A123321
• Smallest squarefree triangular number with exactly n prime factors.at n=7A127637
• a(n) = A027642(n-1) / A089026(n).at n=60A166120
• Denominator of ( A164555(n)/A027642(n) + 1/(n+1) ).at n=60A174342
• Numbers that are divisible by exactly 7 distinct primes.at n=7A176655