10616832

Appears in sequences

• Composites of form prime+1 containing a record number of prime factors.at n=15A066617
• Three people (P1, P2, P3) are in a circle and are saying Hello to each other. They start with P2 saying "Hello, Hello". Thereafter Pn says "Hello" for n times the total number of Hello's so far.at n=15A076507
• Smallest number beginning with 1 and having exactly n prime divisors counted with multiplicity.at n=21A106421
• a(n) = product of the "isolated divisors" of n. A divisor k of n is isolated if neither k-1 nor k+1 divides n.at n=47A134338
• a(n) = n^6*(n+1)^2/2.at n=8A163276
• a(n) = A215723(n) / 2^(n-1).at n=19A215897
• a(n) = A253560(A253883(n)) = A122111((2*A122111(n)) - 1).at n=18A253890
• Number of subsets of {2...n} containing no element whose prime indices all belong to the subset.at n=27A324739
• Terms of A025487 from which the distance to the next larger prime is a composite number.at n=11A329894
• 30*a(n) - 1 is the least prime of the form 2^r*3^s*5^t - 1, r > 0, s > 0, t > 0, r + s + t = n.at n=21A337881
• a(n) = A341108(n)/A195441(n).at n=18A341107
• a(n) = A341108(n)/A195441(n).at n=19A341107
• a(n) = denominator(p(n, x)) / (n!*denominator(bernoulli(n, x))), where p(n, x) = Sum_{k=0..n} E2(n, k)*binomial(x + k, 2*n) / Product_{j=1..n} (j - x) and E2(n, k) are the second-order Eulerian numbers A201637.at n=18A341109
• a(n) = Sum_{p|n, p prime} n^Omega(n/p).at n=47A369908