Sequences
392,541 sequences
- Numbers n such that number of prime factors divided by the number of distinct prime factors is not an integer.A070011
Numbers n such that number of prime factors divided by the number of distinct prime factors is not an integer.
- Floor of number of prime factors of n divided by the number of n's distinct prime factors.A070012
Floor of number of prime factors of n divided by the number of n's distinct prime factors.
- Number of prime factors of n divided by the number of n's distinct prime factors (rounded).A070013
Number of prime factors of n divided by the number of n's distinct prime factors (rounded).
- Ceiling of number of prime factors of n divided by the number of n's distinct prime factors.A070014
Ceiling of number of prime factors of n divided by the number of n's distinct prime factors.
- Least m such that the sum of the aliquot parts of m (A001065) equals n, or 0 if no such number exists.A070015
Least m such that the sum of the aliquot parts of m (A001065) equals n, or 0 if no such number exists.
- Least m such that Chowla's function value of m [A048050(m)] equals n or 0 if no such number exists.A070016
Least m such that Chowla's function value of m [A048050(m)] equals n or 0 if no such number exists.
- Least numbers m such that GCD of two consecutive values of cototients, i.e., gcd(cototient(m+1), cototient(m)) equals 2n - 1.A070017
Least numbers m such that GCD of two consecutive values of cototients, i.e., gcd(cototient(m+1), cototient(m)) equals 2n - 1.
- a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) = 2n.A070018
a(n) = smallest prime p = prime(k) such that gcd( prime(k+1) - prime(k), prime(k+2) - prime(k+1) ) = 2n.
- Duplicate of A056075.A070019
Duplicate of A056075.
- At these values of k the first, 2nd and 3rd cyclotomic polynomials all give prime numbers.A070020
At these values of k the first, 2nd and 3rd cyclotomic polynomials all give prime numbers.
- 1/n has period 1 in base 10 (but not terminating).A070021
1/n has period 1 in base 10 (but not terminating).
- 1/n has period 2 in base 10.A070022
1/n has period 2 in base 10.
- 1/n has period 1 in base 10 (including terminating decimals).A070023
1/n has period 1 in base 10 (including terminating decimals).
- First prime > 10^n in which every substring of length n is prime.A070024
First prime > 10^n in which every substring of length n is prime.
- At these values of k, the 1st, 2nd, 3rd and 4th cyclotomic polynomials all give prime numbers.A070025
At these values of k, the 1st, 2nd, 3rd and 4th cyclotomic polynomials all give prime numbers.
- Initial, all intermediate and final iterated sums of digits of n are primes.A070026
Initial, all intermediate and final iterated sums of digits of n are primes.
- Prime numbers whose initial, all intermediate and final iterated sums of digits are primes.A070027
Prime numbers whose initial, all intermediate and final iterated sums of digits are primes.
- Absolute primes: primes whose initial, all intermediate and final sums of digits are primes.A070028
Absolute primes: primes whose initial, all intermediate and final sums of digits are primes.
- Primes with only prime digits and whose initial, all intermediate and final iterated sums of digits are primes.A070029
Primes with only prime digits and whose initial, all intermediate and final iterated sums of digits are primes.
- Number of closed Knight's tours on a 3 X 2n board.A070030
Number of closed Knight's tours on a 3 X 2n board.
- Expansion of (1+x*C)*C^3, where C = (1-sqrt(1-4*x))/(2*x) is g.f. for Catalan numbers, A000108.A070031
Expansion of (1+x*C)*C^3, where C = (1-sqrt(1-4*x))/(2*x) is g.f. for Catalan numbers, A000108.
- Integer part of sigma(n)/phi(n).A070032
Integer part of sigma(n)/phi(n).
- Least number m such that integer part of sigma(m)/phi(m) equals n.A070033
Least number m such that integer part of sigma(m)/phi(m) equals n.
- Numbers n such that n! reduced modulo 2^n is also a power of 2.A070034
Numbers n such that n! reduced modulo 2^n is also a power of 2.
- Exponents of 2 when A068496(n) is also a power of 2.A070035
Exponents of 2 when A068496(n) is also a power of 2.
- a(n)=A070034(n)-A070035(n).A070036
a(n)=A070034(n)-A070035(n).
- Nonprime numbers k such that sigma(k) == k+1 (mod phi(k)).A070037
Nonprime numbers k such that sigma(k) == k+1 (mod phi(k)).
- a(n) = sum of divisors of n that are at least sqrt(n).A070038
a(n) = sum of divisors of n that are at least sqrt(n).
- Sum of the divisors of n that are < sqrt(n).A070039
Sum of the divisors of n that are < sqrt(n).
- Where records occur in A092419.A070040
Where records occur in A092419.
- Permutation of natural numbers induced by the automorphism df->bf (from the depth-first to breadth-first encoding) acting on the rooted planar binary trees encoded by A014486. (with one-based indexing).A070041
Permutation of natural numbers induced by the automorphism df->bf (from the depth-first to breadth-first encoding) acting on the rooted planar binary trees encoded by A014486. (with one-based indexing).
- At these values of k the 1st, 2nd, 3rd, 4th and 5th cyclotomic polynomials all give prime numbers.A070042
At these values of k the 1st, 2nd, 3rd, 4th and 5th cyclotomic polynomials all give prime numbers.
- Numbers of the form 6*j*k+j+k for positive integers j and k.A070043
Numbers of the form 6*j*k+j+k for positive integers j and k.
- Numbers k such that ceiling(k^1.5) is prime.A070044
Numbers k such that ceiling(k^1.5) is prime.
- Primes of the form ceiling(k^1.5) for some integer k.A070045
Primes of the form ceiling(k^1.5) for some integer k.
- Number of primes between prime(n) and 2*prime(n) exclusive.A070046
Number of primes between prime(n) and 2*prime(n) exclusive.
- Number of partitions of n in which no part appears more than twice and no two parts differ by 1.A070047
Number of partitions of n in which no part appears more than twice and no two parts differ by 1.
- Number of partitions of n into odd parts in which no part appears more than thrice.A070048
Number of partitions of n into odd parts in which no part appears more than thrice.
- Sum of two perfect powers.A070049
Sum of two perfect powers.
- Number of Bottleneck-Monge matrices with 2 rows. In the formula below, P = 2.A070050
Number of Bottleneck-Monge matrices with 2 rows. In the formula below, P = 2.
- Number of Bottleneck-Monge matrices with 3 rows. In the formula below, P=3.A070051
Number of Bottleneck-Monge matrices with 3 rows. In the formula below, P=3.
- Number of Bottleneck-Monge matrices with 4 rows.A070052
Number of Bottleneck-Monge matrices with 4 rows.
- Number of Bottleneck-Monge matrices with 5 rows.A070053
Number of Bottleneck-Monge matrices with 5 rows.
- Number of Bottleneck-Monge matrices with 6 rows.A070054
Number of Bottleneck-Monge matrices with 6 rows.
- Number of Bottleneck-Monge matrices with 7 rows.A070055
Number of Bottleneck-Monge matrices with 7 rows.
- Number of Bottleneck-Monge matrices with 8 rows.A070056
Number of Bottleneck-Monge matrices with 8 rows.
- Number of Bottleneck-Monge matrices with 9 rows.A070057
Number of Bottleneck-Monge matrices with 9 rows.
- Decimal expansion of Newton's gravitational constant in SI units.A070058
Decimal expansion of Newton's gravitational constant in SI units.
- Decimal expansion of proton mass (in kilograms).A070059
Decimal expansion of proton mass (in kilograms).
- Historical estimate for the mass of an electron (in kg). Incorrect version of A081801.A070060
Historical estimate for the mass of an electron (in kg). Incorrect version of A081801.