Sequences
392,541 sequences
- -21*zeta_K(-1), where K runs through the simplest cubic fields.A084711
-21*zeta_K(-1), where K runs through the simplest cubic fields.
- Smallest prime of the form (2n)^k + 1, or 0 if no such number exists.A084712
Smallest prime of the form (2n)^k + 1, or 0 if no such number exists.
- Smallest prime of the form (2n-1)^k + 2, or 0 if no such number exists.A084713
Smallest prime of the form (2n-1)^k + 2, or 0 if no such number exists.
- a(n) = smallest prime of the form (2n-1)^k - 2, or 0 if no such number exists.A084714
a(n) = smallest prime of the form (2n-1)^k - 2, or 0 if no such number exists.
- Smallest number of the form n*k + 1 that is divisible by all the phi(n) numbers less than n and relatively prime to n.A084715
Smallest number of the form n*k + 1 that is divisible by all the phi(n) numbers less than n and relatively prime to n.
- a(1) = 1, a(n) = smallest multiple of a(n-1) > a(n-1) such that a(n) + 1 is a prime.A084716
a(1) = 1, a(n) = smallest multiple of a(n-1) > a(n-1) such that a(n) + 1 is a prime.
- a(1) = 3 then a(n) = smallest multiple of a(n-1) > a(n-1) such that a(n) - 1 is a prime.A084717
a(1) = 3 then a(n) = smallest multiple of a(n-1) > a(n-1) such that a(n) - 1 is a prime.
- a(n) = A084717(n+1)/A084717(n).A084718
a(n) = A084717(n+1)/A084717(n).
- 8190*zeta_K(-3), where K runs through the simplest cubic fields.A084719
8190*zeta_K(-3), where K runs through the simplest cubic fields.
- Primes p such that p+1 is a product of two or more consecutive integers.A084720
Primes p such that p+1 is a product of two or more consecutive integers.
- Primes arising in A083569.A084721
Primes arising in A083569.
- Duplicate of A083566.A084722
Duplicate of A083566.
- Primes arising in A083566. a(n) = n-th partial product of A083566 + 2.A084723
Primes arising in A083566. a(n) = n-th partial product of A083566 + 2.
- Beginning with 2, the smallest even number greater than the previous term such that every partial product + 1 is a prime.A084724
Beginning with 2, the smallest even number greater than the previous term such that every partial product + 1 is a prime.
- Primes arising in A084724. a(n) = N-th partial product of A084724 +1.A084725
Primes arising in A084724. a(n) = N-th partial product of A084724 +1.
- Smallest common difference of the arithmetic progression of length n, beginning with 1 whose product of first n terms + 1 is a prime.A084726
Smallest common difference of the arithmetic progression of length n, beginning with 1 whose product of first n terms + 1 is a prime.
- Primes arising in A084726.A084727
Primes arising in A084726.
- a(n) = smallest multiple of n such that a(1)*a(2)*...*a(n) + 1 is a prime.A084728
a(n) = smallest multiple of n such that a(1)*a(2)*...*a(n) + 1 is a prime.
- Primes arising in A084728.A084729
Primes arising in A084728.
- Smallest prime of the form k*n! - 1.A084730
Smallest prime of the form k*n! - 1.
- Duplicate of A066180.A084731
Duplicate of A066180.
- Let p be the n-th prime; Cp(x) be the p-th cyclotomic polynomial (x^p-1)/(x-1); a(n) is the first prime Cp(x) after Cp(1).A084732
Let p be the n-th prime; Cp(x) be the p-th cyclotomic polynomial (x^p-1)/(x-1); a(n) is the first prime Cp(x) after Cp(1).
- Squares which are the sum of at least three successive terms of a geometric progression.A084733
Squares which are the sum of at least three successive terms of a geometric progression.
- -3591*zeta_K(-5), where K runs through the simplest cubic fields.A084734
-3591*zeta_K(-5), where K runs through the simplest cubic fields.
- Let p = n-th prime, let q = smallest prime having p as its least prime primitive root; sequence gives least (not necessarily prime) primitive root of q.A084735
Let p = n-th prime, let q = smallest prime having p as its least prime primitive root; sequence gives least (not necessarily prime) primitive root of q.
- a(1) = 2, a(2) = 3; for n > 0, a(n+2) is the smallest prime chosen so that (a(n+2) - a(n+1))/(a(n+1) - a(n)) is an integer.A084736
a(1) = 2, a(2) = 3; for n > 0, a(n+2) is the smallest prime chosen so that (a(n+2) - a(n+1))/(a(n+1) - a(n)) is an integer.
- Beginning with 1, numbers such that (a(n+2)-a(n+1))/(a(n+1)-a(n)) = prime(n).A084737
Beginning with 1, numbers such that (a(n+2)-a(n+1))/(a(n+1)-a(n)) = prime(n).
- Smallest prime of the form (n^k-1)/(n-1), or 0 if no such prime exists.A084738
Smallest prime of the form (n^k-1)/(n-1), or 0 if no such prime exists.
- Let p = n-th prime, then a(n) = smallest prime having p as its least prime primitive root.A084739
Let p = n-th prime, then a(n) = smallest prime having p as its least prime primitive root.
- Least k such that (n^k-1)/(n-1) is prime, or 0 if no such prime exists.A084740
Least k such that (n^k-1)/(n-1) is prime, or 0 if no such prime exists.
- Smallest prime of the form (n^k+1)/(n+1), or 0 if no such prime exists.A084741
Smallest prime of the form (n^k+1)/(n+1), or 0 if no such prime exists.
- Least k such that (n^k+1)/(n+1) is prime, or 0 if no such prime exists.A084742
Least k such that (n^k+1)/(n+1) is prime, or 0 if no such prime exists.
- Smallest prime of the form n^k + k, or 0 if no such prime exists.A084743
Smallest prime of the form n^k + k, or 0 if no such prime exists.
- Product of all composite numbers from 1 to the n-th nonprime number divided by product of all the prime divisors of each of those composite numbers which exceed the previously stated value.A084744
Product of all composite numbers from 1 to the n-th nonprime number divided by product of all the prime divisors of each of those composite numbers which exceed the previously stated value.
- Smallest prime of the form n^k - k, or 0 if no such prime exists.A084745
Smallest prime of the form n^k - k, or 0 if no such prime exists.
- Smallest k such that n^k - k is a prime, or 0 if no such number exists.A084746
Smallest k such that n^k - k is a prime, or 0 if no such number exists.
- Leading diagonal of triangle (shown below) in which row n lists the n smallest positive numbers k such that k + n is a prime.A084747
Leading diagonal of triangle (shown below) in which row n lists the n smallest positive numbers k such that k + n is a prime.
- Primes of the form n! + p where p is the smallest prime > n.A084748
Primes of the form n! + p where p is the smallest prime > n.
- Numbers m such that m! + p is a prime, where p is the smallest prime > m.A084749
Numbers m such that m! + p is a prime, where p is the smallest prime > m.
- Numbers k such that k! - p is a prime, where p is the smallest prime > k.A084750
Numbers k such that k! - p is a prime, where p is the smallest prime > k.
- Primes of the form k! - p, where p is the smallest prime > k.A084751
Primes of the form k! - p, where p is the smallest prime > k.
- A064623(n)/s, where s = sum of the prime divisors of A064623(n).A084752
A064623(n)/s, where s = sum of the prime divisors of A064623(n).
- Erroneous version of A081964.A084753
Erroneous version of A081964.
- Triangle read by rows: row n lists the first n primes greater than n.A084754
Triangle read by rows: row n lists the first n primes greater than n.
- Let the sequence s_n be defined by s_n(1) = n+1 and for k > 1, s_n(k) = k*s_n(k-1)+1. Then a(n) is the first prime in the sequence s_n.A084755
Let the sequence s_n be defined by s_n(1) = n+1 and for k > 1, s_n(k) = k*s_n(k-1)+1. Then a(n) is the first prime in the sequence s_n.
- For n, k > 0, let T(n, k) be given by T(n, 1) = n and T(n, k+1) = k*T(n, k) + 1. Then a(n) = T(n, n).A084756
For n, k > 0, let T(n, k) be given by T(n, 1) = n and T(n, k+1) = k*T(n, k) + 1. Then a(n) = T(n, n).
- For n, k > 0, let T(n, k) be given by T(n, 1) = n and T(n, k+1) = k*T(n, k) + 1. a(n) is the sum of the n-th antidiagonal.A084757
For n, k > 0, let T(n, k) be given by T(n, 1) = n and T(n, k+1) = k*T(n, k) + 1. a(n) is the sum of the n-th antidiagonal.
- The slowest increasing sequence of primes such that difference of successive terms is unique.A084758
The slowest increasing sequence of primes such that difference of successive terms is unique.
- Composite numbers in ascending order such that the difference of successive terms is unique. a(m) - a(m-1) = a(k) - a(k-1) iff m = k.A084759
Composite numbers in ascending order such that the difference of successive terms is unique. a(m) - a(m-1) = a(k) - a(k-1) iff m = k.
- Squarefree numbers in ascending order such that the difference of successive terms is unique. a(m) - a(m-1) = a(k) - a(k-1) iff m = k.A084760
Squarefree numbers in ascending order such that the difference of successive terms is unique. a(m) - a(m-1) = a(k) - a(k-1) iff m = k.