49665

Appears in sequences

• Odd numbers with exactly 5 distinct prime factors.at n=19A046391
• a(n) = lcm(n, n+1, n+2, n+3)/12.at n=41A067047
• Numbers n such that the middle coefficient of the cyclotomic polynomial Phi_n(x) has a value not obtained for any smaller n.at n=24A095877
• a(n) is the LCM of the Jacobsthal sequence {J(1),...,J(n)}.at n=6A105611
• Odd squarefree abundant numbers.at n=16A112643
• Number triangle T(n,k) = (-1)^(n-k)*[k<=n]*Product_{i=k+1..n} Sum_{j=0..i-1} A078008(j-1).at n=31A128210
• Odd unitary abundant numbers.at n=16A129485
• Numbers k such that the sum of the Carmichael lambda functions of the divisors is a proper divisor of k.at n=26A131492
• Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) is not coefficient convex.at n=30A146960
• Numbers n such that n^2 can be represented as sum of (at least two) consecutive cubes and n is not a triangular number.at n=35A163393
• A four product triangle sequence based on :a=2;f(n,a)=f(n - 1, a) + a*f(n - 2, a).at n=16A174187
• A four product triangle sequence based on :a=2;f(n,a)=f(n - 1, a) + a*f(n - 2, a).at n=19A174187
• Number of nX4 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 0 1 1 vertically.at n=8A207119
• The stonemason's problem: numbers n such that n^2 is the sum of more than three consecutive cubes, the cube 1 being disallowed.at n=36A238099
• Triangle read by rows: coefficients of polynomials related to the exponential generating function of sequences generated by Narayana polynomials evaluated at the integers; n>=1, 0<=k<n.at n=40A247502
• Primitive, odd, squarefree abundant numbers.at n=16A249263
• Octagonal numbers (A000567) that are the sum of eleven consecutive octagonal numbers.at n=0A258131
• Least number x such that x^n has n digits equal to k. Case k = 3.at n=32A285450
• Squarefree primitive abundant numbers (first definition: having only deficient proper divisors).at n=35A298973
• a(n) = denominator(2^n*Sum_{k=0..n} binomial(n, k)*Bernoulli(k, 1/2)*x^(n-k)).at n=42A336454