Sequences
392,541 sequences
- Consider the sequence {b(m)} of nonprimes; sequence gives values of m where gcd{m, b(m)} increases.A058011
Consider the sequence {b(m)} of nonprimes; sequence gives values of m where gcd{m, b(m)} increases.
- Consider the sequence {b(m)} of composite numbers (excluding 1); sequence gives values of b(m) where gcd(m, b(m)) increases.A058012
Consider the sequence {b(m)} of composite numbers (excluding 1); sequence gives values of b(m) where gcd(m, b(m)) increases.
- Smallest prime p such that (n+1)^p - n^p is prime.A058013
Smallest prime p such that (n+1)^p - n^p is prime.
- Number of labeled trees with n+1 nodes such that the degrees of all nodes, excluding the first node, are odd.A058014
Number of labeled trees with n+1 nodes such that the degrees of all nodes, excluding the first node, are odd.
- Numbers k such that 2^k + k^3 is prime.A058015
Numbers k such that 2^k + k^3 is prime.
- Digits of the zero of the 37-adic L-function with cyclotomic character of index 31.A058016
Digits of the zero of the 37-adic L-function with cyclotomic character of index 31.
- a(n) is the smallest prime > LCM(1,...,x), where x is the n-th prime power (A000961).A058017
a(n) is the smallest prime > LCM(1,...,x), where x is the n-th prime power (A000961).
- Difference between LCM(1,...,x) and the smallest prime > LCM(1,...,x), where x is the n-th prime power (A000961).A058018
Difference between LCM(1,...,x) and the smallest prime > LCM(1,...,x), where x is the n-th prime power (A000961).
- a(n) is the smallest prime > A051451(n)+1.A058019
a(n) is the smallest prime > A051451(n)+1.
- Difference between lcm(1,..,n) and the smallest prime > lcm(1,...,n) + 1, where n runs over A000961, lcm(n) runs through A051451.A058020
Difference between lcm(1,..,n) and the smallest prime > lcm(1,...,n) + 1, where n runs over A000961, lcm(n) runs through A051451.
- Largest prime preceding distinct values of lcm(1,...,m): Max{p|p < A003418(A000961(n))}. To get different LCM values, the last arguments(m) of LCM were selected from A000961.A058021
Largest prime preceding distinct values of lcm(1,...,m): Max{p|p < A003418(A000961(n))}. To get different LCM values, the last arguments(m) of LCM were selected from A000961.
- Difference between lcm(1,..,n) and the largest prime before lcm(1,..,n) where n runs over the prime powers A000961, LCMs are in A051451.A058022
Difference between lcm(1,..,n) and the largest prime before lcm(1,..,n) where n runs over the prime powers A000961, LCMs are in A051451.
- a(n) is the largest prime < A051451(n) - 1.A058023
a(n) is the largest prime < A051451(n) - 1.
- a(n) = A051451(n) - A058023(n).A058024
a(n) = A051451(n) - A058023(n).
- Numbers k such that 3*13^k - 2 is prime.A058025
Numbers k such that 3*13^k - 2 is prime.
- Number of positive integers, k, where k <= n and gcd(k,n) = gcd(k+1,n) = 1.A058026
Number of positive integers, k, where k <= n and gcd(k,n) = gcd(k+1,n) = 1.
- Sum of terms of continued fraction for n-th harmonic number, 1 + 1/2 + 1/3 + ... + 1/n.A058027
Sum of terms of continued fraction for n-th harmonic number, 1 + 1/2 + 1/3 + ... + 1/n.
- Sum of the terms of the continued fraction for the sum of the reciprocals of the first n primes.A058028
Sum of the terms of the continued fraction for the sum of the reciprocals of the first n primes.
- Primes closest to LCM(1,...,x) either above or below. Arguments x were selected from A000961 (powers of primes including primes) in order to obtain distinct values of LCM exactly once.A058029
Primes closest to LCM(1,...,x) either above or below. Arguments x were selected from A000961 (powers of primes including primes) in order to obtain distinct values of LCM exactly once.
- Signed distance of primes from LCM(1,...,x) being closest to it. Arguments x were selected from A000961 (powers of primes including primes) in order to use distinct values of LCM exactly once. When both closest primes are in the same distance, then negative were used.A058030
Signed distance of primes from LCM(1,...,x) being closest to it. Arguments x were selected from A000961 (powers of primes including primes) in order to use distinct values of LCM exactly once. When both closest primes are in the same distance, then negative were used.
- a(n) = n^4 - 2*n^3 + 3*n^2 - 2*n + 1, the Alexander polynomial for reef and granny knots.A058031
a(n) = n^4 - 2*n^3 + 3*n^2 - 2*n + 1, the Alexander polynomial for reef and granny knots.
- Largest m such that 2^n / primorial(m) >= 1.A058032
Largest m such that 2^n / primorial(m) >= 1.
- Number of powers of 2 between (but not including) two consecutive primorials.A058033
Number of powers of 2 between (but not including) two consecutive primorials.
- Number of numbers whose cube root rounds to n.A058034
Number of numbers whose cube root rounds to n.
- Largest 4th-power-free number dividing n.A058035
Largest 4th-power-free number dividing n.
- Smallest primitive prime factor of the n-th Lucas number (A000032); i.e., L(n), L(0) = 2, L(1) = 1 and L(n) = L(n-1) + L(n-2).A058036
Smallest primitive prime factor of the n-th Lucas number (A000032); i.e., L(n), L(0) = 2, L(1) = 1 and L(n) = L(n-1) + L(n-2).
- Numbers k such that 3^k - k is prime.A058037
Numbers k such that 3^k - k is prime.
- a(n) = Fibonacci(2*n)*Fibonacci(2*n+2).A058038
a(n) = Fibonacci(2*n)*Fibonacci(2*n+2).
- a(n) = a(n-1) + 2*a(floor(n/2)) if n > 0, otherwise 1.A058039
a(n) = a(n-1) + 2*a(floor(n/2)) if n > 0, otherwise 1.
- Numbers k such that if p_1,p_2,...,p_m, m>1, are the prime factors of k, then there is some b>0 such that k = Sum_{i=1..m} b^(p_i).A058040
Numbers k such that if p_1,p_2,...,p_m, m>1, are the prime factors of k, then there is some b>0 such that k = Sum_{i=1..m} b^(p_i).
- Noncubes equal to the sum of cubes of their prime factors.A058041
Noncubes equal to the sum of cubes of their prime factors.
- Trajectory of binary number 10110 under the operation 'Reverse and Add!' carried out in base 2.A058042
Trajectory of binary number 10110 under the operation 'Reverse and Add!' carried out in base 2.
- a(n) = nextprime(n^2) - prevprime(n^2).A058043
a(n) = nextprime(n^2) - prevprime(n^2).
- Difference between the smallest prime following and largest prime preceding n-th primorial number.A058044
Difference between the smallest prime following and largest prime preceding n-th primorial number.
- Numbers k such that (5^k + k)/3 is prime.A058045
Numbers k such that (5^k + k)/3 is prime.
- Numbers k such that 5^k - k is prime.A058046
Numbers k such that 5^k - k is prime.
- Generalized Collatz sequences: primes resulting in a cycle containing 1.A058047
Generalized Collatz sequences: primes resulting in a cycle containing 1.
- For each prime P consider the generalized Collatz sequence of each integer N > 1 defined by c(0) = N, c(m+1) = c(m) * P + 1 if F > P, else c(m+1) = c(m) / F, where F is the smallest factor of c(m), until the sequence cycles. If all c(i) > 1 for some starting number N then P belongs to the sequence (and vice versa).A058048
For each prime P consider the generalized Collatz sequence of each integer N > 1 defined by c(0) = N, c(m+1) = c(m) * P + 1 if F > P, else c(m+1) = c(m) / F, where F is the smallest factor of c(m), until the sequence cycles. If all c(i) > 1 for some starting number N then P belongs to the sequence (and vice versa).
- Numbers k such that the sum of the digits of the first k primes is a prime.A058049
Numbers k such that the sum of the digits of the first k primes is a prime.
- a(n) is the number of different graphs drawn in the following way: you decide for each number k <= n on a pair of positive numbers (x(k),y(k)) such that x(k)+y(k)=k; you draw n points numbered 1 to n; draw two arrows from n, one to x(n) and one to y(n); draw two arrows from each k already reached by an arrow, one to x(k) and one to y(k). The process stops when 1 is the only point reached by an arrow without any arrow leaving it; you can also erase the isolated points.A058050
a(n) is the number of different graphs drawn in the following way: you decide for each number k <= n on a pair of positive numbers (x(k),y(k)) such that x(k)+y(k)=k; you draw n points numbered 1 to n; draw two arrows from n, one to x(n) and one to y(n); draw two arrows from each k already reached by an arrow, one to x(k) and one to y(k). The process stops when 1 is the only point reached by an arrow without any arrow leaving it; you can also erase the isolated points.
- a(n) = F(F(F(n))), where F is a Fibonacci number (A000045).A058051
a(n) = F(F(F(n))), where F is a Fibonacci number (A000045).
- Sum of the distances between the 2^n vertices in the De Bruijn Graphs on words of length n on alphabet {0,1}.A058052
Sum of the distances between the 2^n vertices in the De Bruijn Graphs on words of length n on alphabet {0,1}.
- Number of 3-rowed binary matrices with n ones and no zero columns, up to row and column permutation.A058053
Number of 3-rowed binary matrices with n ones and no zero columns, up to row and column permutation.
- Smallest prime > n! minus largest prime <= n!.A058054
Smallest prime > n! minus largest prime <= n!.
- a(n) is the smallest positive number m such that m^2 + n is the next prime > m^2.A058055
a(n) is the smallest positive number m such that m^2 + n is the next prime > m^2.
- a(n) = p is the smallest prime such that p = n + h(n)^2 and p is the first prime following h(n)^2. The smallest immediate post-square primes with distance n = p - h(n)^2.A058056
a(n) = p is the smallest prime such that p = n + h(n)^2 and p is the first prime following h(n)^2. The smallest immediate post-square primes with distance n = p - h(n)^2.
- Triangle giving coefficients of ménage hit polynomials.A058057
Triangle giving coefficients of ménage hit polynomials.
- Generalized Somos-7 sequence: a(n)*a(n+7) = 3*a(n+1)*a(n+6) - 4*a(n+2)* a(n+5) + 4*a(n+3)*a(n+4).A058058
Generalized Somos-7 sequence: a(n)*a(n+7) = 3*a(n+1)*a(n+6) - 4*a(n+2)* a(n+5) + 4*a(n+3)*a(n+4).
- Numbers n such that x^n + x + 2 is irreducible over GF(3).A058059
Numbers n such that x^n + x + 2 is irreducible over GF(3).
- Number of distinct prime factors of d(n), the number of divisors of n.A058060
Number of distinct prime factors of d(n), the number of divisors of n.