526680

Appears in sequences

• Number of rational points of Klein curve over GF(2^n).at n=18A048635
• Numbers that can be expressed as the difference of the squares of primes in exactly twenty-two distinct ways.at n=0A092018
• Least number that can be expressed as the difference of the squares of primes in exactly n distinct ways.at n=21A092204
• Smallest number having exactly n divisors d such that also d+2 is a divisor.at n=27A099476
• a(n) is the smallest number k such that Fibonacci(k) is a multiple of primorial(n).at n=13A114419
• Highly abundant numbers (A002093) that are not Harshad numbers (A005349).at n=8A128702
• a(n) = the smallest positive integer with exactly n positive "non-isolated divisors". A divisor, k, of n is non-isolated if (k-1) or (k+1) also divides n.at n=30A133996
• Numbers with prime factorization pqrst^2u^3.at n=2A190390
• Number of (n+1)X4 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.at n=5A205731
• Number of 7X(n+1) 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.at n=2A205742
• Numbers k such that floor(Sum_{d|k} 1 / sigma(d)) = 3.at n=15A265713
• T(n, k) = Sum_{j=0..k} (-1)^j*binomial(2*k, j)*(k - j)^(2*n)/k!, triangle read by rows, n >= 0 and 0 <= k <= n.at n=25A304334
• Triangle T(n,m) = C(2*m-1,m)*C(n+2*m-1,n-m).at n=51A338037
• Numbers k where A093653(k)/A000120(k) sets a new record.at n=34A360641
• For n > 1, if n appears in the sequence, a(n) = a(n-1) - n if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + n. Otherwise a(n+1) = a(n)/(n+1) if (n+1)|a(n), otherwise a(n)*(n+1), a(1) = 1 and a(2) = 1*2.at n=11A362698
• a(n) = 3*(4*n+2)!/(3*n+3)!.at n=5A370057
• a(n) = Sum_{k=0..n} (k+1) * binomial(k,4*(n-k)).at n=19A392076
• a(n) = Sum_{k=0..floor(n/2)} (k+1) * binomial(k,2*(n-2*k)).at n=38A392251