Sequences
392,541 sequences
- Composites which use less than all of their digits in their prime factorization.A074211
Composites which use less than all of their digits in their prime factorization.
- Number of steps to reach an integer starting with (2^n + 1)/2^n and iterating the map x->x*ceiling(x).A074212
Number of steps to reach an integer starting with (2^n + 1)/2^n and iterating the map x->x*ceiling(x).
- Sum of the prime factors of k equals half the sum of the prime factors of k + 1.A074213
Sum of the prime factors of k equals half the sum of the prime factors of k + 1.
- Integers m such that F(m) and F(2m) have the same largest prime factor where F(k) denotes the k-th Fibonacci number.A074214
Integers m such that F(m) and F(2m) have the same largest prime factor where F(k) denotes the k-th Fibonacci number.
- Numbers m such that m and F(m) are relatively prime, where F(m) denotes the m-th Fibonacci number.A074215
Numbers m such that m and F(m) are relatively prime, where F(m) denotes the m-th Fibonacci number.
- Squares satisfying sigma(n)==0 (mod 3).A074216
Squares satisfying sigma(n)==0 (mod 3).
- Numbers k such that floor(k^Pi) is a prime.A074217
Numbers k such that floor(k^Pi) is a prime.
- Primes of the form floor(k^Pi).A074218
Primes of the form floor(k^Pi).
- Numbers k such that ceiling(k^Pi) is prime.A074219
Numbers k such that ceiling(k^Pi) is prime.
- Primes of the form ceiling(n^Pi).A074220
Primes of the form ceiling(n^Pi).
- Numbers k such that floor(k^e) is prime.A074221
Numbers k such that floor(k^e) is prime.
- Primes of the form floor(n^e).A074222
Primes of the form floor(n^e).
- Numbers n such that ceiling(n^e) is prime.A074223
Numbers n such that ceiling(n^e) is prime.
- Primes of the form ceiling(n^e).A074224
Primes of the form ceiling(n^e).
- a(n) = n * Sum_{d|n} d*2^(d-1).A074225
a(n) = n * Sum_{d|n} d*2^(d-1).
- Numbers n such that Kronecker(3,n) = 1.A074226
Numbers n such that Kronecker(3,n) = 1.
- Duplicate of A042965.A074227
Duplicate of A042965.
- Even bases k for which the smallest (Fermat) pseudoprime greater than k has Moebius function mu = -1.A074228
Even bases k for which the smallest (Fermat) pseudoprime greater than k has Moebius function mu = -1.
- Numbers n such that Kronecker(6,n)==mu(gcd(6,n)).A074229
Numbers n such that Kronecker(6,n)==mu(gcd(6,n)).
- Numbers n such that A089509(n)=1.A074230
Numbers n such that A089509(n)=1.
- Numbers k such that Kronecker(8,k) = mu(gcd(8,k)).A074231
Numbers k such that Kronecker(8,k) = mu(gcd(8,k)).
- Positive numbers that are not 3 or 6 (mod 9).A074232
Positive numbers that are not 3 or 6 (mod 9).
- Numbers whose base-4 and base-5 representations are permutations of the same multiset of digits.A074233
Numbers whose base-4 and base-5 representations are permutations of the same multiset of digits.
- Number of nodes of integer unit lattice covered by integer right triangles.A074234
Number of nodes of integer unit lattice covered by integer right triangles.
- Numbers that cannot be a long leg of an integer right triangle.A074235
Numbers that cannot be a long leg of an integer right triangle.
- Numbers that are the long leg of some integer right triangle and the hypotenuse of some other integer right triangle.A074236
Numbers that are the long leg of some integer right triangle and the hypotenuse of some other integer right triangle.
- Composites which use more than all their digits in their prime factorization.A074237
Composites which use more than all their digits in their prime factorization.
- Numbers k such that the sum of the reverses of 1,2,...,k is a perfect square.A074238
Numbers k such that the sum of the reverses of 1,2,...,k is a perfect square.
- Related to cumulative number of non-twin primes.A074239
Related to cumulative number of non-twin primes.
- Numbers k such that k-th prime = sigma(sigma(k)) + 1.A074240
Numbers k such that k-th prime = sigma(sigma(k)) + 1.
- Numbers n such that phi(n+1) = reverse(phi(n)).A074241
Numbers n such that phi(n+1) = reverse(phi(n)).
- Numbers n such that sigma(n+1) = reverse(sigma(n)).A074242
Numbers n such that sigma(n+1) = reverse(sigma(n)).
- Numbers n such that every integer has a cube root mod n.A074243
Numbers n such that every integer has a cube root mod n.
- Numbers k such that phi(k) is a harmonic number.A074244
Numbers k such that phi(k) is a harmonic number.
- Numbers k such that sigma(k) is a harmonic number.A074245
Numbers k such that sigma(k) is a harmonic number.
- Triangle of coefficients, read by rows, where the n-th row forms the polynomial P(n,x) = {Sum_{k=1..n} 1/(k+x)}*{Product_{k=1..n} (k+x)}.A074246
Triangle of coefficients, read by rows, where the n-th row forms the polynomial P(n,x) = {Sum_{k=1..n} 1/(k+x)}*{Product_{k=1..n} (k+x)}.
- Numbers n such that harmonic mean of the divisors of n is a prime.A074247
Numbers n such that harmonic mean of the divisors of n is a prime.
- Triangle of coefficients, read by rows of (2n+1) terms, where the n-th row forms a polynomial in x, P(n,x), of degree 2n and satisfies: P(n,x) = [Sum_{k=1..n} 1/(k + x + x^2)]*[Product_{k=1..n} (k + x + x^2)].A074248
Triangle of coefficients, read by rows of (2n+1) terms, where the n-th row forms a polynomial in x, P(n,x), of degree 2n and satisfies: P(n,x) = [Sum_{k=1..n} 1/(k + x + x^2)]*[Product_{k=1..n} (k + x + x^2)].
- a(n) = largest prime factor of 7^n-1.A074249
a(n) = largest prime factor of 7^n-1.
- Smallest p>1 for which n^p ends in n, or -1 if no such p exists. The smallest p for which n is a p-morphic number.A074250
Smallest p>1 for which n^p ends in n, or -1 if no such p exists. The smallest p for which n is a p-morphic number.
- Sum of the squarefree numbers from the smallest prime factor of n to the largest prime factor of n.A074251
Sum of the squarefree numbers from the smallest prime factor of n to the largest prime factor of n.
- Number of primes <= n is equal to the sum of squarefree numbers from the smallest prime factor of n to the largest prime factor of n.A074252
Number of primes <= n is equal to the sum of squarefree numbers from the smallest prime factor of n to the largest prime factor of n.
- Numbers n such that the sum of squarefree numbers from the smallest prime factor of n to the largest prime factor of n is a square.A074253
Numbers n such that the sum of squarefree numbers from the smallest prime factor of n to the largest prime factor of n is a square.
- Composite numbers equal to the sum of the squarefree numbers from their smallest prime factor to their largest prime factor.A074254
Composite numbers equal to the sum of the squarefree numbers from their smallest prime factor to their largest prime factor.
- Numbers n such that the sum of composites from the smallest prime factor of n to the largest prime factor of n is equal to the sum of squarefree numbers from the smallest prime factor of n to the largest prime factor of n.A074255
Numbers n such that the sum of composites from the smallest prime factor of n to the largest prime factor of n is equal to the sum of squarefree numbers from the smallest prime factor of n to the largest prime factor of n.
- Numbers k such that the sum of factorials of the digits of k equals the sum of the primes from the smallest prime factor of k to the largest prime factor of k.A074256
Numbers k such that the sum of factorials of the digits of k equals the sum of the primes from the smallest prime factor of k to the largest prime factor of k.
- Sum of factorials of digits of n equals the largest prime factor of n.A074257
Sum of factorials of digits of n equals the largest prime factor of n.
- Gaps between primes p such that 2p-1 is also prime.A074258
Gaps between primes p such that 2p-1 is also prime.
- Gaps between primes p such that 2p+1 is also prime, i.e., Sophie-Germain primes A005384.A074259
Gaps between primes p such that 2p+1 is also prime, i.e., Sophie-Germain primes A005384.
- Number of labeled cyclic subgroups of S_n having the maximum possible order.A074260
Number of labeled cyclic subgroups of S_n having the maximum possible order.