41055

Appears in sequences

• a(n) = T(n,n-3), where T is the array in A026386.at n=41A026394
• Odd numbers with exactly 5 distinct prime factors.at n=13A046391
• Difference between partial sums of partition numbers (A026905) and partial sums of numbers of partitions into distinct parts (A026906).at n=31A056870
• a(n) is both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers.at n=34A059270
• Least m such that n = m mod tau(m) if such m exists, otherwise 0.at n=30A066708
• Sum of numbers that can be written as t*n + u*(n+1) for nonnegative integers t,u in exactly one way.at n=13A076454
• Smallest number covering bitwise exactly n prime factors.at n=5A102555
• Odd squarefree abundant numbers.at n=11A112643
• Odd infinitary abundant numbers.at n=32A127666
• Odd unitary abundant numbers.at n=11A129485
• Odd primitive abundant numbers of the form (2*P)^2+2*P+p^2 with P and p primes and p^2<4*P.at n=1A133778
• Odd primitive abundant numbers n such that n = x^2 + x + y^2 with y^2 < 2*x; a subsequence of A006038.at n=6A136476
• Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) is not coefficient convex.at n=21A146960
• Number of reduced words of length n in Coxeter group on 15 generators S_i with relations (S_i)^2 = (S_i S_j)^4 = I.at n=4A163091
• Expansion of (1+4*x+x^2)/((1+x)^2*(1-x)^5).at n=26A233329
• Primitive, odd, squarefree abundant numbers.at n=11A249263
• Odd bi-unitary abundant numbers: odd numbers k such that bsigma(k) > 2*k, where bsigma is the sum of the bi-unitary divisors function (A188999).at n=36A293186
• Squarefree primitive abundant numbers (first definition: having only deficient proper divisors).at n=30A298973
• a(n) = n*(2*n + 1)*(4*n + 1).at n=17A316224
• Odd unitary abundant numbers whose unitary abundancy is closer to 2 than that of any smaller odd unitary abundant number.at n=8A335052