41361

Appears in sequences

• a(n) = x is the least number such that around x^2 (the center) the number of primes is equal to n. The radius of neighborhood is ceiling(log(x^2)).at n=9A096840
• Number of partitions of n for which (number of occurrences of the least part) > (number of occurrences of greatest part).at n=41A236544
• Numbers n such that sopfr(n) = sopfr(n-1) + sopfr(n-2), where sopfr is the sum of prime factors of n with multiplicity (A001414).at n=10A294995
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} 2^j * binomial(n,j)^k.at n=49A336203