Sequences
392,541 sequences
- Smallest k such that k*i^2 + 1 is prime for i = 1 to n.A089761
Smallest k such that k*i^2 + 1 is prime for i = 1 to n.
- a(1) = 1, then nonzero digits (1 to 9) such that every n-th concatenation is prime if n is prime else it is composite. The previous digits are so chosen that a single digit with prime index gives a prime.A089762
a(1) = 1, then nonzero digits (1 to 9) such that every n-th concatenation is prime if n is prime else it is composite. The previous digits are so chosen that a single digit with prime index gives a prime.
- a(1) = 1, then the least n-digit prime such that the k-th digit from the Most significant side is prime if k is prime else is composite. The most significant digit is always a 1. 0 if no such prime exists.A089763
a(1) = 1, then the least n-digit prime such that the k-th digit from the Most significant side is prime if k is prime else is composite. The most significant digit is always a 1. 0 if no such prime exists.
- Primes of the form k! followed by a 1.A089764
Primes of the form k! followed by a 1.
- Composite n whose sum of distinct divisors, s(d), ignoring divisors n and 1, divided by the count of divisors (not counting n and 1), c(d), are primes. Duplicate divisors, as in 2*2=4 are counted just once.A089765
Composite n whose sum of distinct divisors, s(d), ignoring divisors n and 1, divided by the count of divisors (not counting n and 1), c(d), are primes. Duplicate divisors, as in 2*2=4 are counted just once.
- Smallest prime obtained as k*n! concatenated with a 1 for some k.A089766
Smallest prime obtained as k*n! concatenated with a 1 for some k.
- Squares which when concatenated with a 1 gives prime.A089767
Squares which when concatenated with a 1 gives prime.
- Smallest prime which leaves n distinct primes when a suitable digit is deleted.A089768
Smallest prime which leaves n distinct primes when a suitable digit is deleted.
- Duplicate of A033274.A089769
Duplicate of A033274.
- Smallest n-digit prime containing no prime substrings, or 0 if no such number exists.A089770
Smallest n-digit prime containing no prime substrings, or 0 if no such number exists.
- Largest n-digit prime containing no prime substrings, or 0 if no such prime exists.A089771
Largest n-digit prime containing no prime substrings, or 0 if no such prime exists.
- a(n) = Lucas(11*n).A089772
a(n) = Lucas(11*n).
- Smallest prime of the form 1 followed by a perfect power.A089773
Smallest prime of the form 1 followed by a perfect power.
- Primes of the form 1 followed by powers of 3.A089774
Primes of the form 1 followed by powers of 3.
- Lucas numbers L(12n).A089775
Lucas numbers L(12n).
- If n mod 10 is 1, 3, 7, or 9, then a(n) = least prime of the form 1 followed by n^r; else a(n) = least prime of the form n^r followed by a 1. In both cases r must be > 1 and a(n) = 0 if no such prime exists.A089776
If n mod 10 is 1, 3, 7, or 9, then a(n) = least prime of the form 1 followed by n^r; else a(n) = least prime of the form n^r followed by a 1. In both cases r must be > 1 and a(n) = 0 if no such prime exists.
- a(n) = smallest prime of the form n followed by a prime.A089777
a(n) = smallest prime of the form n followed by a prime.
- a(n) is the n-th prime that ends with prime(n), or 0 if there do not exist n primes ending with prime(n).A089778
a(n) is the n-th prime that ends with prime(n), or 0 if there do not exist n primes ending with prime(n).
- Let n range through the odd numbers skipping multiples of 5; a(n) = n-th prime ending in n.A089779
Let n range through the odd numbers skipping multiples of 5; a(n) = n-th prime ending in n.
- Lexicographically earliest sequence of nonnegative integers such that concatenation of n terms beginning with a(n) is prime.A089780
Lexicographically earliest sequence of nonnegative integers such that concatenation of n terms beginning with a(n) is prime.
- Successive coprime numbers with distinct successive differences: gcd(a(k+1),a(k)) = gcd(a(m+1),a(m)) = 1 and a(k+1)-a(k) = a(m+1)-a(m) <==> m=k.A089781
Successive coprime numbers with distinct successive differences: gcd(a(k+1),a(k)) = gcd(a(m+1),a(m)) = 1 and a(k+1)-a(k) = a(m+1)-a(m) <==> m=k.
- Smallest prime of the form prime(k) concatenated with prime(k+n).A089782
Smallest prime of the form prime(k) concatenated with prime(k+n).
- Smallest prime(k) pertaining to A089782.A089783
Smallest prime(k) pertaining to A089782.
- A nonsense sequence.A089784
A nonsense sequence.
- a(n) is the least prime(k) such that the concatenation of prime(k) and prime(k-n) is prime.A089785
a(n) is the least prime(k) such that the concatenation of prime(k) and prime(k-n) is prime.
- Primes of the form prime(2k) followed by prime(k).A089786
Primes of the form prime(2k) followed by prime(k).
- a(4n-3), a(4n-2), a(4n-1), and a(4n) are the units digit of the n-th prime followed by 1, 3, 7, and 9 respectively.A089787
a(4n-3), a(4n-2), a(4n-1), and a(4n) are the units digit of the n-th prime followed by 1, 3, 7, and 9 respectively.
- Primes of the form prime(nk) followed by prime(k).A089788
Primes of the form prime(nk) followed by prime(k).
- Number of irreducible factors of Gauss polynomials.A089789
Number of irreducible factors of Gauss polynomials.
- Number of projections of rational knots and links with n crossings.A089790
Number of projections of rational knots and links with n crossings.
- Number of projections of rational knots with n crossings.A089791
Number of projections of rational knots with n crossings.
- a(n) = n-(exponent of highest power of 3 dividing n!).A089792
a(n) = n-(exponent of highest power of 3 dividing n!).
- a(n) = the first prime in the earliest chain of 2n+1 consecutive primes whose sum is prime.A089793
a(n) = the first prime in the earliest chain of 2n+1 consecutive primes whose sum is prime.
- Number of amphichiral alternating knots with n=2k crossings (k=2,3,4,...).A089794
Number of amphichiral alternating knots with n=2k crossings (k=2,3,4,...).
- Smallest prime(k) such that prime(k)-prime(k-1) is equal to prime(k+n)-prime(k).A089795
Smallest prime(k) such that prime(k)-prime(k-1) is equal to prime(k+n)-prime(k).
- Series reversion of g.f. A(x) is -A(-x).A089796
Series reversion of g.f. A(x) is -A(-x).
- Number of rational knots and links with unknotting (unlinking) number U=1.A089797
Number of rational knots and links with unknotting (unlinking) number U=1.
- Expansion of Jacobi theta function theta_4(q^2).A089798
Expansion of Jacobi theta function theta_4(q^2).
- Expansion of Jacobi theta function theta_2(q^(1/2))/q^(1/8).A089799
Expansion of Jacobi theta function theta_2(q^(1/2))/q^(1/8).
- Expansion of Jacobi theta function theta_2(q)/q^(1/4).A089800
Expansion of Jacobi theta function theta_2(q)/q^(1/4).
- a(n) = 0 unless n = 3j^2 + 2j or 3j^2 + 4j + 1 for some j >= 0, in which case a(n) = 1.A089801
a(n) = 0 unless n = 3j^2 + 2j or 3j^2 + 4j + 1 for some j >= 0, in which case a(n) = 1.
- Expansion of q^(-1/3) * (theta_4(q^3) - theta_4(q^(1/3))) / 2 in powers of q.A089802
Expansion of q^(-1/3) * (theta_4(q^3) - theta_4(q^(1/3))) / 2 in powers of q.
- Expansion of Jacobi theta function theta_4(q^5).A089803
Expansion of Jacobi theta function theta_4(q^5).
- Expansion of Jacobi theta function theta_4^3(q^5).A089804
Expansion of Jacobi theta function theta_4^3(q^5).
- Expansion of Jacobi theta function (theta_4(q^6) - theta_4(q^(2/3)))/2/q^(2/3).A089805
Expansion of Jacobi theta function (theta_4(q^6) - theta_4(q^(2/3)))/2/q^(2/3).
- Expansion of Jacobi theta function (theta_3(q^(1/3))-theta_2(q^3))/2/q^(1/12).A089806
Expansion of Jacobi theta function (theta_3(q^(1/3))-theta_2(q^3))/2/q^(1/12).
- Expansion of Jacobi theta function (3theta_3(q^9)-theta_3(q))/2.A089807
Expansion of Jacobi theta function (3theta_3(q^9)-theta_3(q))/2.
- a(n) = floor(1/((n*r) mod 1)), where r = phi^(-2) = (3 - sqrt(5))/2.A089808
a(n) = floor(1/((n*r) mod 1)), where r = phi^(-2) = (3 - sqrt(5))/2.
- Complement of A078588.A089809
Complement of A078588.
- Expansion of Jacobi theta function theta_3(Pi/6, q) in powers of q.A089810
Expansion of Jacobi theta function theta_3(Pi/6, q) in powers of q.