40976

Appears in sequences

• Number of sets S = {a_1, a_2, ..., a_k}, with 1 < a_i < a_j <= n such that no a_j divides the product of all the others.at n=26A023995
• a(n) = n*(7*n^2-4)/3.at n=26A063521
• 3-apexes of Omega: numbers k such that Omega(k-3) < Omega(k-2)< Omega(k-1) < Omega(k) > Omega(k+1) > Omega(k+2) > Omega(k+3), where Omega(m) = the number of prime factors of m, counting multiplicity.at n=8A076760
• Primonacci numbers: a(n)=a(n-2)+a(n-3)+a(n-5)+a(n-7)+a(n-11)+...+a(n-p(k))+... until n <= p(k), where p(k) is the k-th prime. a(1)=a(2)=1.at n=29A078465
• Scaled coefficients of the M. O. Rubinstein polynomials.at n=30A153359
• A triangle related to the a(n) formulas of the rows of the ED3 array A167572.at n=23A167580
• The third left hand column of triangle A167580.at n=4A167582
• a(n) is the number of permutations of length n that avoid the pattern 321 and the mesh pattern (12, 267) or the same sequence for the mesh pattern (12, 417).at n=11A289594
• Number of not unique partition coefficients of n.at n=42A309897
• Indices where prime(n) first appears in A373902.at n=46A371618