51765

Appears in sequences

• a(n) = n*(n+5)*(n+6)*(n+7)/24.at n=29A005587
• Numbers in which all pairs of consecutive base-7 digits differ by 3.at n=47A033078
• Odd numbers with exactly 5 distinct prime factors.at n=22A046391
• Partial sums of second pentagonal numbers with even index (A049453).at n=29A051895
• Odd numbers k such that abs(sigma(k)-2k) <= sqrt(k). Abundance-radius = abs(sigma(k)-2k) does not exceed square root of k and k is odd.at n=26A087415
• 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=25A095877
• Fifth column (m=4) of (1,6)-Pascal triangle A096956.at n=27A096958
• Odd squarefree abundant numbers.at n=18A112643
• Odd unitary abundant numbers.at n=18A129485
• Odd primitive abundant numbers n such that n = x^2 + x + y^2 with y^2 < 2*x; a subsequence of A006038.at n=10A136476
• Odd primitive abundant numbers n such that n = x^2 + x + y^2 with y^2 < 2*x and x and y primes, subsequence of A136476.at n=1A136479
• Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) is not coefficient convex.at n=33A146960
• Partial sums of primes in which no digit is a prime A061372.at n=14A172523
• Products of 5 distinct primes a,b,c,d,e, such that a+b+c+d+e are prime numbers.at n=4A178782
• Number of standard Young tableaux of shape [4n,4].at n=8A215544
• a(n) = binomial(9*n,n)*(7*n+1)/(8*n+1).at n=4A215553
• Primitive, odd, squarefree abundant numbers.at n=18A249263
• Expansion of (1-2*x)^2/((1-x)^4*(1-4*x)).at n=8A262594
• Squarefree primitive abundant numbers (first definition: having only deficient proper divisors).at n=38A298973
• Numbers k such that k and k+1 have at least 4 but not both exactly 4 distinct prime factors.at n=3A321494