Sequences
392,541 sequences
- Continued fraction for arithmetic-geometric mean (AGM) of first two primes 2 and 3.A074961
Continued fraction for arithmetic-geometric mean (AGM) of first two primes 2 and 3.
- Decimal expansion of Glaisher-Kinkelin constant A.A074962
Decimal expansion of Glaisher-Kinkelin constant A.
- Max ( sigma(x*y) : 1<=x<=n, 1<=y<=n ).A074963
Max ( sigma(x*y) : 1<=x<=n, 1<=y<=n ).
- Numbers k such that Max ( sigma(x*y) : 1 <= x <= k, 1 <= y <= k ) = sigma(k^2).A074964
Numbers k such that Max ( sigma(x*y) : 1 <= x <= k, 1 <= y <= k ) = sigma(k^2).
- Primes p for which there is an integer k such that (2*k+1)*p=2*k*q+1, where q is the next prime after p. Equivalently, (p-1)/(2*(q-p)) is an integer.A074965
Primes p for which there is an integer k such that (2*k+1)*p=2*k*q+1, where q is the next prime after p. Equivalently, (p-1)/(2*(q-p)) is an integer.
- a(n) = least k such that n^n + k is prime.A074966
a(n) = least k such that n^n + k is prime.
- a(n) = least k such that n^n - k is prime.A074967
a(n) = least k such that n^n - k is prime.
- a(n) = minimal m such that Sum_{k=1..m+1} prime(k) > prime(n) * prime(m+1).A074968
a(n) = minimal m such that Sum_{k=1..m+1} prime(k) > prime(n) * prime(m+1).
- Numbers with six distinct prime divisors.A074969
Numbers with six distinct prime divisors.
- Number of steps to reach the first integer starting with sigma(n)/n and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.A074970
Number of steps to reach the first integer starting with sigma(n)/n and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.
- Number of partitions of n into distinct parts of order n.A074971
Number of partitions of n into distinct parts of order n.
- a(n) == - prime(n) (modulo 20).A074972
a(n) == - prime(n) (modulo 20).
- Smallest index i such that next_prime( 2*prime(i) ) - 2*prime(i) = 2n - 1.A074973
Smallest index i such that next_prime( 2*prime(i) ) - 2*prime(i) = 2n - 1.
- Deficient numbers such that the sum of their individual digits when raised to their own power is an abundant number.A074974
Deficient numbers such that the sum of their individual digits when raised to their own power is an abundant number.
- Abundant numbers such that the sum of their individual digits when raised to their own power is an abundant number.A074975
Abundant numbers such that the sum of their individual digits when raised to their own power is an abundant number.
- a(n) = round(1/(sqrt(prime(n+1)) - sqrt(prime(n)))).A074976
a(n) = round(1/(sqrt(prime(n+1)) - sqrt(prime(n)))).
- Duplicate of A069155.A074977
Duplicate of A069155.
- Prime(prime(n)) ends with n.A074978
Prime(prime(n)) ends with n.
- Primes for which the two closest primes are smaller.A074979
Primes for which the two closest primes are smaller.
- Numbers which are not of the form m^p - n^q where p = 2 or 3, q = 2 or 3.A074980
Numbers which are not of the form m^p - n^q where p = 2 or 3, q = 2 or 3.
- Conjectured list of positive numbers which are not of the form r^i - s^j, where r,s,i,j are integers with r>0, s>0, i>1, j>1.A074981
Conjectured list of positive numbers which are not of the form r^i - s^j, where r,s,i,j are integers with r>0, s>0, i>1, j>1.
- Primes for which the three closest primes are smaller.A074982
Primes for which the three closest primes are smaller.
- Successive factors of the Fibonacci word A003842.A074983
Successive factors of the Fibonacci word A003842.
- m^p-n, for smallest m^p>=n.A074984
m^p-n, for smallest m^p>=n.
- Squares of semiprimes (A001358).A074985
Squares of semiprimes (A001358).
- Number of nonempty subsets of {1,2,3,...,n} that are closed under both GCD and LCM.A074986
Number of nonempty subsets of {1,2,3,...,n} that are closed under both GCD and LCM.
- a(n) is the least m not equal to n such that phi(m) = phi(n).A074987
a(n) is the least m not equal to n such that phi(m) = phi(n).
- Numbers n such that the k-th binary digit of n equals mu(k)^2 for k=1 up to A029837(n+1).A074988
Numbers n such that the k-th binary digit of n equals mu(k)^2 for k=1 up to A029837(n+1).
- Distance from n to nearest cube.A074989
Distance from n to nearest cube.
- Number of primes in the interval (n,3n].A074990
Number of primes in the interval (n,3n].
- Concatenation of n, n+1, n+2 divided by 3.A074991
Concatenation of n, n+1, n+2 divided by 3.
- a(n) = (10^(2*n) + 10^n + 1)/3.A074992
a(n) = (10^(2*n) + 10^n + 1)/3.
- a(n) = floor((concatenation of n, n+1)/2).A074993
a(n) = floor((concatenation of n, n+1)/2).
- Floor of concatenation of n, n+1, n+2, n+3 divided by 4.A074994
Floor of concatenation of n, n+1, n+2, n+3 divided by 4.
- Floor of concatenation of n, n+1, n+2, n+3, n+4 divided by 5.A074995
Floor of concatenation of n, n+1, n+2, n+3, n+4 divided by 5.
- Floor of concatenation of n, n+1, n+2, n+3, n+4, n+5 divided by 6.A074996
Floor of concatenation of n, n+1, n+2, n+3, n+4, n+5 divided by 6.
- Numbers which are sandwiched between two numbers having the same unordered canonical form.A074997
Numbers which are sandwiched between two numbers having the same unordered canonical form.
- Composite numbers which are sandwiched between two numbers having the same unordered canonical form.A074998
Composite numbers which are sandwiched between two numbers having the same unordered canonical form.
- Floor[concatenation of nine consecutive numbers from n to n+8 divided by 9].A074999
Floor[concatenation of nine consecutive numbers from n to n+8 divided by 9].
- Smallest number such that n*a(n) is a concatenation of n consecutive integers; or 0 if no such number exists.A075000
Smallest number such that n*a(n) is a concatenation of n consecutive integers; or 0 if no such number exists.
- Smallest k such that the concatenation of n consecutive numbers starting with k (from k to n+k-1) is a multiple of n; or 0 if no such number exists.A075001
Smallest k such that the concatenation of n consecutive numbers starting with k (from k to n+k-1) is a multiple of n; or 0 if no such number exists.
- a(n) = smallest k such that A007908(k) is divisible by n.A075002
a(n) = smallest k such that A007908(k) is divisible by n.
- Floor[ concatenation of n+1 and n divided by 2 ].A075003
Floor[ concatenation of n+1 and n divided by 2 ].
- Floor[ concatenation of n+2, n+1 and n divided by 3 ].A075004
Floor[ concatenation of n+2, n+1 and n divided by 3 ].
- Floor[ concatenation of n+3, n+2, n+1 and n divided by 4 ].A075005
Floor[ concatenation of n+3, n+2, n+1 and n divided by 4 ].
- Floor[ concatenation of n+4, n+3, n+2, n+1 and n divided by 5].A075006
Floor[ concatenation of n+4, n+3, n+2, n+1 and n divided by 5].
- a(n) = floor(concatenation of n+5, n+4, n+3, n+2, n+1 and n divided by 6).A075007
a(n) = floor(concatenation of n+5, n+4, n+3, n+2, n+1 and n divided by 6).
- Floor[ concatenation of 7 numbers from n+6 to n in that order divided by 7].A075008
Floor[ concatenation of 7 numbers from n+6 to n in that order divided by 7].
- Floor[ concatenation of 8 numbers from n+7 to n in that order divided by 8].A075009
Floor[ concatenation of 8 numbers from n+7 to n in that order divided by 8].
- a(n) = floor( concatenation of 9 numbers from n+8 to n in that order divided by 9 ).A075010
a(n) = floor( concatenation of 9 numbers from n+8 to n in that order divided by 9 ).