29640

Appears in sequences

• a(n) = n*(n+1)*(n+2)/2.at n=38A027480
• a(n) = lcm(n,n+1,n+2).at n=37A033931
• LCM of composite numbers falling between n-th and (n+1)-st primes.at n=10A056831
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,7.at n=30A064240
• Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,63.at n=4A065699
• Successive maxima in sequence A007365.at n=14A065933
• Least integer such that e^n/(ceiling(e^n) + a(n)) monotonically decreases.at n=10A084787
• Numbers that can be expressed as the difference of the squares of primes in exactly five distinct ways.at n=32A092001
• Number of edges in LCM of graphs K_n and C_4.at n=38A098585
• Number of partitions of n with more odd parts than even parts.at n=40A108950
• a(1) = 1, then LCM of consecutive composite numbers sandwiched between primes.at n=24A109920
• Least sum (n+1) + (n+2) + ... + (n+k) that is a multiple of the n-th triangular number, n(n+1)/2.at n=37A110351
• Septuple factorial, 7-factorial, n!7, n!!!!!!!, a(n) = n*a(n-7) if n > 1, else 1.at n=26A114799
• a(n) = n*(n^2 - 1)/2.at n=39A135503
• Numbers k such that k^2 + 1 is a Sarrus number (pseudoprime to base 2).at n=7A135590
• a(1) = 1; a(n) = (7*n-9)*a(n-1) for n > 1.at n=4A147585
• Triangle T(n, k) = Product_{j=0..k} (j*n + prime(m)), with T(n, 0) = prime(m) and m = 3, read by rows.at n=31A153271
• a(0)=1, a(n) = (3n-1)*3n*(3n+1)/2 for n>0.at n=13A157024
• Numbers with exactly 64 divisors.at n=32A172443
• a(n) = 19*n*(n+1).at n=39A173309