Sequences
392,541 sequences
- Numbers k such that sopf(k) + 1 = sopf(k+1), where sopf(k) = A008472(k).A064111
Numbers k such that sopf(k) + 1 = sopf(k+1), where sopf(k) = A008472(k).
- Numbers k such that sopf(k) = 2*sopf(k+1), where sopf(k) = A008472.A064112
Numbers k such that sopf(k) = 2*sopf(k+1), where sopf(k) = A008472.
- Indices k such that (1/3)*(prime(k)+prime(k+1)+prime(k+2)) is a prime.A064113
Indices k such that (1/3)*(prime(k)+prime(k+1)+prime(k+2)) is a prime.
- Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188).A064114
Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188).
- Numbers k such that k and k+1 have the same sum of non-unitary divisors (A048146), for A048146(k) > 0.A064115
Numbers k such that k and k+1 have the same sum of non-unitary divisors (A048146), for A048146(k) > 0.
- Composite numbers whose sum of aliquot divisors as well as product of aliquot divisors is a perfect square.A064116
Composite numbers whose sum of aliquot divisors as well as product of aliquot divisors is a perfect square.
- Primes formed by the initial digits of the decimal expansion of the golden ratio phi = (1+sqrt(5))/2.A064117
Primes formed by the initial digits of the decimal expansion of the golden ratio phi = (1+sqrt(5))/2.
- Numbers k such that the first k digits of e form a prime.A064118
Numbers k such that the first k digits of e form a prime.
- Numbers k such that the first k digits of the Golden Ratio form a prime.A064119
Numbers k such that the first k digits of the Golden Ratio form a prime.
- A036981(n)/n!^2.A064120
A036981(n)/n!^2.
- Nonprime numbers n such that the sum of aliquot divisors of n (A001065) and product of aliquot divisors of n (A048741) are both perfect squares.A064121
Nonprime numbers n such that the sum of aliquot divisors of n (A001065) and product of aliquot divisors of n (A048741) are both perfect squares.
- Number of divisors of 3^n - 1 that are relatively prime to 3^m - 1 for all 0 < m < n.A064122
Number of divisors of 3^n - 1 that are relatively prime to 3^m - 1 for all 0 < m < n.
- Number of divisors of 5^n - 1 that are relatively prime to 5^m - 1 for all 0 < m < n.A064123
Number of divisors of 5^n - 1 that are relatively prime to 5^m - 1 for all 0 < m < n.
- Number of divisors of 7^n - 1 that are relatively prime to 7^m - 1 for all 0 < m < n.A064124
Number of divisors of 7^n - 1 that are relatively prime to 7^m - 1 for all 0 < m < n.
- Numbers k such that k and k+1 have the same sum of unitary divisors (A034448).A064125
Numbers k such that k and k+1 have the same sum of unitary divisors (A034448).
- Number of divisors of 10^n - 1 that are relatively prime to 10^m - 1 for all 0 < m < n.A064126
Number of divisors of 10^n - 1 that are relatively prime to 10^m - 1 for all 0 < m < n.
- Number of divisors of 11^n - 1 that are relatively prime to 11^m - 1 for all 0 < m < n.A064127
Number of divisors of 11^n - 1 that are relatively prime to 11^m - 1 for all 0 < m < n.
- Number of divisors of 6^n - 1 that are relatively prime to 6^m - 1 for all 0 < m < n.A064128
Number of divisors of 6^n - 1 that are relatively prime to 6^m - 1 for all 0 < m < n.
- Number of divisors of 12^n - 1 that are relatively prime to 12^m - 1 for all 0 < m < n.A064129
Number of divisors of 12^n - 1 that are relatively prime to 12^m - 1 for all 0 < m < n.
- Number of divisors of 2^n + 1 that are relatively prime to 2^m + 1 for all 0 < m < n.A064130
Number of divisors of 2^n + 1 that are relatively prime to 2^m + 1 for all 0 < m < n.
- Number of divisors of 3^n + 1 that are relatively prime to 3^m + 1 for all 0 < m < n.A064131
Number of divisors of 3^n + 1 that are relatively prime to 3^m + 1 for all 0 < m < n.
- Number of divisors of 5^n + 1 that are relatively prime to 5^m + 1 for all 0 < m < n.A064132
Number of divisors of 5^n + 1 that are relatively prime to 5^m + 1 for all 0 < m < n.
- Number of divisors of 6^n + 1 that are relatively prime to 6^m + 1 for all 0 < m < n.A064133
Number of divisors of 6^n + 1 that are relatively prime to 6^m + 1 for all 0 < m < n.
- Number of divisors of 7^n + 1 that are relatively prime to 7^m + 1 for all 0 < m < n.A064134
Number of divisors of 7^n + 1 that are relatively prime to 7^m + 1 for all 0 < m < n.
- Number of divisors of 10^n + 1 that are relatively prime to 10^m + 1 for all 0 < m < n.A064135
Number of divisors of 10^n + 1 that are relatively prime to 10^m + 1 for all 0 < m < n.
- Number of divisors of 11^n + 1 that are relatively prime to 11^m + 1 for all 0 < m < n.A064136
Number of divisors of 11^n + 1 that are relatively prime to 11^m + 1 for all 0 < m < n.
- Number of divisors of 12^n + 1 that are relatively prime to 12^m + 1 for all 0 < m < n.A064137
Number of divisors of 12^n + 1 that are relatively prime to 12^m + 1 for all 0 < m < n.
- Sum of non-unitary divisors of n!.A064138
Sum of non-unitary divisors of n!.
- Sum of divisors of central binomial coefficient binomial(n, floor(n/2)).A064139
Sum of divisors of central binomial coefficient binomial(n, floor(n/2)).
- Sum of unitary divisors of central binomial coefficient C(n, floor(n/2)).A064140
Sum of unitary divisors of central binomial coefficient C(n, floor(n/2)).
- Sum of non-unitary divisors of central binomial coefficient C(n, floor(n/2)).A064141
Sum of non-unitary divisors of central binomial coefficient C(n, floor(n/2)).
- Sum of all distinct primes dividing central binomial coefficient C(n, floor(n/2)).A064142
Sum of all distinct primes dividing central binomial coefficient C(n, floor(n/2)).
- Sum of unitary prime divisors of binomial(n, floor(n/2)).A064143
Sum of unitary prime divisors of binomial(n, floor(n/2)).
- a(n) is the number of divisors of n!+1.A064144
a(n) is the number of divisors of n!+1.
- a(n) = tau(n!-1) or number of divisors of n!-1.A064145
a(n) = tau(n!-1) or number of divisors of n!-1.
- Sum of non-unitary prime divisors of binomial(n,floor(n/2)).A064146
Sum of non-unitary prime divisors of binomial(n,floor(n/2)).
- Numbers k such that k! - 1 and k! + 1 have the same number of divisors, i.e., tau(k! - 1) = tau(k! + 1).A064147
Numbers k such that k! - 1 and k! + 1 have the same number of divisors, i.e., tau(k! - 1) = tau(k! + 1).
- Numbers k such that mu(k) = mu(k+1), where mu is the Möbius function (A008683).A064148
Numbers k such that mu(k) = mu(k+1), where mu is the Möbius function (A008683).
- Indices of zeros of third differences of primes: Numbers k such that A036264(k) = 0.A064149
Indices of zeros of third differences of primes: Numbers k such that A036264(k) = 0.
- Numbers divisible by the sum of their ternary digits.A064150
Numbers divisible by the sum of their ternary digits.
- Number of primes < n^n.A064151
Number of primes < n^n.
- Erdős primes: primes p such that all p-k! for 1 <= k! < p are composite.A064152
Erdős primes: primes p such that all p-k! for 1 <= k! < p are composite.
- Values of n that are not solution of pr(x)=n where pr(x) is the prime partition function of x.A064153
Values of n that are not solution of pr(x)=n where pr(x) is the prime partition function of x.
- Numbers whose product of digits equals the number of digits times the sum of digits.A064154
Numbers whose product of digits equals the number of digits times the sum of digits.
- Primes whose product of digits equals the number of digits times the sum of digits.A064155
Primes whose product of digits equals the number of digits times the sum of digits.
- Smallest prime with n decimal digits such that the product of its digits equals n times the sum of its digits, or 0 if no such prime exists.A064156
Smallest prime with n decimal digits such that the product of its digits equals n times the sum of its digits, or 0 if no such prime exists.
- Primes p such that (x1*x2*...*xk)^(x1+x2+...+xk) = (x1+x2+...+xk)^(x1*x2*...*xk) where x1x2...xk are the digits of p in base 10.A064157
Primes p such that (x1*x2*...*xk)^(x1+x2+...+xk) = (x1+x2+...+xk)^(x1*x2*...*xk) where x1x2...xk are the digits of p in base 10.
- Integers m such that (x1*x2*..xk)^(x1+x2+..xk) = (x1+x2+..xk)^(x1*x2*..xk) where x1x2..xk are the digits of m in base 10.A064158
Integers m such that (x1*x2*..xk)^(x1+x2+..xk) = (x1+x2+..xk)^(x1*x2*..xk) where x1x2..xk are the digits of m in base 10.
- Numbers n such that g(n) + sopfr(n) = n, where g(n)= number of nonprimes <=n (A062298) and sopfr(n) = sum of primes dividing n with repetition (A001414).A064159
Numbers n such that g(n) + sopfr(n) = n, where g(n)= number of nonprimes <=n (A062298) and sopfr(n) = sum of primes dividing n with repetition (A001414).
- Numbers k such that the digits of k joined to the digits of 2k contain each of the digits from 1 to 9 once.A064160
Numbers k such that the digits of k joined to the digits of 2k contain each of the digits from 1 to 9 once.