24255
domain: N
Appears in sequences
- a(1)=10; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^e_i * Product p_{i+3}^e_i.at n=11A045973
- Numbers k such that 11^k == -1 (mod k-1).at n=11A055694
- Number of distinct Cunningham chains of first kind whose initial prime (cf. A059453) <= 2^n.at n=21A059690
- Numbers n such that n + (sum of prime factors of n) = next prime after n.at n=33A105779
- Total number of palindromic primes in base 9 below 9^n.at n=10A117787
- Total number of palindromic primes in base 9 below 9^n.at n=11A117787
- Denominators associated with A120031.at n=9A120032
- Triangle T(n,k) = total of number at last index for all set partitions of n into k parts.at n=40A120095
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+857)^2 = y^2.at n=7A129857
- Numerators of triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) is the coefficient of x^(2k+1) in polynomial u_n(x), used to approximate x->sin(Pi*x)/Pi.at n=34A144846
- Numbers with exactly 4 distinct odd prime divisors {3,5,7,11}.at n=7A147577
- a(n) = 729*n - 531.at n=33A156771
- Triangle T(n, k) = coefficients of p(n, x), where p(n, x) = (-1)^n*(1+x)*((n+1)^2 +x)^(n-1), p(0, x) = 1, and p(1, x) = -1-x, read by rows.at n=25A158286
- T(n,k) = denominator of 2*Pi*Sum_{j=0..n-k-1} ((-1)^j*n*(k + j + 2)*(n + k +j)!*(k + j)!^2)/((n - k - j - 1)!*(2*k + j + 1)!*j!*Gamma(k + j + 3/2)*Gamma(k + j + 5/2)), triangle read by rows (n >= 1, 0 <= k <= n - 1).at n=12A159983
- Numbers k such that phi(phi(k)) = sigma(rad(k)).at n=31A173748
- Number of nX2 1..6 arrays with every element value z a city block distance of exactly z from another element value z.at n=5A209056
- T(n,k)=Number of nXk 1..6 arrays with every element value z a city block distance of exactly z from another element value z.at n=22A209058
- T(n,k)=Number of nXk 1..6 arrays with every element value z a city block distance of exactly z from another element value z.at n=26A209058
- Number of nX2 1..7 arrays with every element value z a city block distance of exactly z from another element value z.at n=5A209213
- T(n,k)=Number of nXk 1..7 arrays with every element value z a city block distance of exactly z from another element value z.at n=22A209215