Search Results for ""

A number n is called an economical number if the number of digits in the prime factorization of n (including powers) uses fewer digits than the number of digits in n. The ...

A number n is called an Egyptian number if it is the sum of the denominators in some unit fraction representation of a positive whole number not consisting entirely of 1s. ...

The functions E_1(x) = (x^2e^x)/((e^x-1)^2) (1) E_2(x) = x/(e^x-1) (2) E_3(x) = ln(1-e^(-x)) (3) E_4(x) = x/(e^x-1)-ln(1-e^(-x)). (4) E_1(x) has an inflection point at (5) ...

Let omega be the cube root of unity (-1+isqrt(3))/2. Then the Eisenstein primes are Eisenstein integers, i.e., numbers of the form a+bomega for a and b integers, such that ...

1 0 1 0 1 1 0 1 2 2 0 2 4 5 5 (1) The Entringer numbers E(n,k) (OEIS A008281) are the number of permutations of {1,2,...,n+1}, starting with k+1, which, after initially ...

The case of the Weierstrass elliptic function with invariants g_2=0 and g_3=1. The corresponding real half-period is given by omega_2 = (Gamma^3(1/3))/(4pi) (1) = ...

A number n is called equidigital if the number of digits in the prime factorization of n (including powers) uses the same number of digits as the number of digits in n. The ...

The Erdős-Borwein constant E, sometimes also denoted alpha, is the sum of the reciprocals of the Mersenne numbers, E = sum_(n=1)^(infty)1/(2^n-1) (1) = ...

The Erdős-Selfridge function g(k) is defined as the least integer bigger than k+1 such that the least prime factor of (g(k); k) exceeds k, where (n; k) is the binomial ...

The "imaginary error function" erfi(z) is an entire function defined by erfi(z)=-ierf(iz), (1) where erf(z) is the erf function. It is implemented in the Wolfram Language as ...