Sequences
392,541 sequences
- Primes consisting only of digits 1 and 3 occurring with equal frequency.A087511
Primes consisting only of digits 1 and 3 occurring with equal frequency.
- Primes consisting only of digits 1 and 4 occurring with equal frequency.A087512
Primes consisting only of digits 1 and 4 occurring with equal frequency.
- Primes consisting only of digits 1 and 6 occurring with equal frequency.A087513
Primes consisting only of digits 1 and 6 occurring with equal frequency.
- Primes consisting only of digits 1 and 7 occurring with equal frequency.A087514
Primes consisting only of digits 1 and 7 occurring with equal frequency.
- Primes consisting only of digits 1 and 9 occurring with equal frequency.A087515
Primes consisting only of digits 1 and 9 occurring with equal frequency.
- Consider pairs (i,j) such that j*P(i)# - P(i+2) and j*P(i)# - P(i+1) are consecutive primes and 0 < j < P(i+1), where P(r) = r-th prime and P(r)# = r-th primorial number (A002110). Sequence gives i values.A087516
Consider pairs (i,j) such that j*P(i)# - P(i+2) and j*P(i)# - P(i+1) are consecutive primes and 0 < j < P(i+1), where P(r) = r-th prime and P(r)# = r-th primorial number (A002110). Sequence gives i values.
- j values from A087516.A087517
j values from A087516.
- Number of arrangements of 1..n^2 in n X n array with exactly one local maximum.A087518
Number of arrangements of 1..n^2 in n X n array with exactly one local maximum.
- Number of arrangements of 1..n^2 in n X n array with one local minimum and one local maximum.A087519
Number of arrangements of 1..n^2 in n X n array with one local minimum and one local maximum.
- Smallest prime p such that the prime signature of p-1 has not occurred earlier.A087520
Smallest prime p such that the prime signature of p-1 has not occurred earlier.
- Smallest prime p such that the prime signature of p+1 has not occurred earlier.A087521
Smallest prime p such that the prime signature of p+1 has not occurred earlier.
- a(0) = 2; for n>=1, a(n) = smallest prime p such that p+1 is divisible by an n-th power > 1.A087522
a(0) = 2; for n>=1, a(n) = smallest prime p such that p+1 is divisible by an n-th power > 1.
- a(0) = 2, a(n) = smallest prime == n mod a(n-1), a(n)>a(n-1).A087523
a(0) = 2, a(n) = smallest prime == n mod a(n-1), a(n)>a(n-1).
- a(0) = 2, a(n)=smallest prime > a(n-1) such that a(n) - a(n-1) == 0 mod n!.A087524
a(0) = 2, a(n)=smallest prime > a(n-1) such that a(n) - a(n-1) == 0 mod n!.
- Primes p with the property that p-q does not divide p+q for all primes q < p.A087525
Primes p with the property that p-q does not divide p+q for all primes q < p.
- a(0) = 1, a(n) = smallest squarefree number == 1 (mod a(n-1)) with n prime divisors.A087526
a(0) = 1, a(n) = smallest squarefree number == 1 (mod a(n-1)) with n prime divisors.
- Primes consisting only of digits 2 and 3 occurring with equal frequency.A087527
Primes consisting only of digits 2 and 3 occurring with equal frequency.
- Primes consisting only of digits 2 and 9 occurring with equal frequency.A087528
Primes consisting only of digits 2 and 9 occurring with equal frequency.
- Primes consisting only of digits 3 and 4 occurring with equal frequency.A087529
Primes consisting only of digits 3 and 4 occurring with equal frequency.
- Primes consisting only of digits 3 and 5 occurring with equal frequency.A087530
Primes consisting only of digits 3 and 5 occurring with equal frequency.
- Primes consisting only of digits 3 and 7 occurring with equal frequency.A087531
Primes consisting only of digits 3 and 7 occurring with equal frequency.
- Primes consisting only of digits 3 and 8 occurring with equal frequency.A087532
Primes consisting only of digits 3 and 8 occurring with equal frequency.
- Primes consisting only of digits 4 and 7 occurring with equal frequency.A087533
Primes consisting only of digits 4 and 7 occurring with equal frequency.
- Primes consisting only of digits 4 and 9 occurring with equal frequency.A087534
Primes consisting only of digits 4 and 9 occurring with equal frequency.
- Primes consisting only of digits 5 and 9 occurring with equal frequency.A087535
Primes consisting only of digits 5 and 9 occurring with equal frequency.
- Primes consisting only of digits 6 and 7 occurring with equal frequency.A087536
Primes consisting only of digits 6 and 7 occurring with equal frequency.
- Primes consisting only of digits 7 and 9 occurring with equal frequency.A087537
Primes consisting only of digits 7 and 9 occurring with equal frequency.
- Primes consisting only of digits 8 and 9 occurring with equal frequency.A087538
Primes consisting only of digits 8 and 9 occurring with equal frequency.
- First differences of A011849.A087539
First differences of A011849.
- Let A(n) be the matrix in the group GL(n,2) such that for 1 <= i, j <= n: A[i,j] = 1 if i+j = n+1 A[i,j] = 0 if i+j != n+1. a(n) is the size of the centralizer of A(n) in GL(n,2).A087540
Let A(n) be the matrix in the group GL(n,2) such that for 1 <= i, j <= n: A[i,j] = 1 if i+j = n+1 A[i,j] = 0 if i+j != n+1. a(n) is the size of the centralizer of A(n) in GL(n,2).
- a(0) = 1, a(1) = 2, a(n) = smallest prime beginning with the product of two previous terms.A087541
a(0) = 1, a(1) = 2, a(n) = smallest prime beginning with the product of two previous terms.
- a(0) = 1, a(1) = 3, a(n) = smallest prime beginning with the product of two previous terms.A087542
a(0) = 1, a(1) = 3, a(n) = smallest prime beginning with the product of two previous terms.
- a(0) =1, a(1) = 2, a(n) = smallest prime beginning with the sum of two previous terms.A087543
a(0) =1, a(1) = 2, a(n) = smallest prime beginning with the sum of two previous terms.
- a(0) = 1, a(1) = 3, a(n) = smallest prime beginning with the sum of two previous terms.A087544
a(0) = 1, a(1) = 3, a(n) = smallest prime beginning with the sum of two previous terms.
- a(0) = 0, a(1) = 1, a(n) = smallest multiple of n beginning with the sum of two previous terms.A087545
a(0) = 0, a(1) = 1, a(n) = smallest multiple of n beginning with the sum of two previous terms.
- a(1) = 1, a(2) = 2, a(n) = smallest multiple of n beginning with the product of two previous terms.A087546
a(1) = 1, a(2) = 2, a(n) = smallest multiple of n beginning with the product of two previous terms.
- a(n) = n!*2^(n+1) * (Integral_{x = 0..1} 1/(1+x^2)^(n+1) dx) - Pi*(2*n)!/(2^(n+1)*n!).A087547
a(n) = n!*2^(n+1) * (Integral_{x = 0..1} 1/(1+x^2)^(n+1) dx) - Pi*(2*n)!/(2^(n+1)*n!).
- Beginning with 1, smallest multiple of n such that a(n)*a(n-1) + 1 is a prime.A087548
Beginning with 1, smallest multiple of n such that a(n)*a(n-1) + 1 is a prime.
- a(1) = 1, a(2) = 1, a(n) = sum of tau(n) previous terms, where tau(n) is the number of divisors of n.A087549
a(1) = 1, a(2) = 1, a(n) = sum of tau(n) previous terms, where tau(n) is the number of divisors of n.
- a(n) = smallest k such that for each r, 2 <= r <= n, there exists a distinct s, n < s <= k, with the same prime signature as r.A087550
a(n) = smallest k such that for each r, 2 <= r <= n, there exists a distinct s, n < s <= k, with the same prime signature as r.
- Start of the second run of n successive primes which have the same successive differences as the prime sequence (7,11,13,17,19,23,29,31,37,41,43,...) beginning with 7. The first differences are 4,2,4,2,4,6,2,6,4,2,4,6,6,2,6,4,2,...A087551
Start of the second run of n successive primes which have the same successive differences as the prime sequence (7,11,13,17,19,23,29,31,37,41,43,...) beginning with 7. The first differences are 4,2,4,2,4,6,2,6,4,2,4,6,6,2,6,4,2,...
- a(1) = 1, then the smallest prime divisor of A065447(n) not included earlier.A087552
a(1) = 1, then the smallest prime divisor of A065447(n) not included earlier.
- Squares in which the neighboring digits differ at most by 1. Neighbors of 1 are 0 and 2, neighbors of 0 are 1 and 9.A087553
Squares in which the neighboring digits differ at most by 1. Neighbors of 1 are 0 and 2, neighbors of 0 are 1 and 9.
- a(n) = smallest number k >= n such that nk + 1 is a prime.A087554
a(n) = smallest number k >= n such that nk + 1 is a prime.
- a(n) = largest prime that is the concatenation of two numbers whose sum is n.A087555
a(n) = largest prime that is the concatenation of two numbers whose sum is n.
- a(n) = smallest prime that is the concatenation of two numbers whose sum is n.A087556
a(n) = smallest prime that is the concatenation of two numbers whose sum is n.
- a(n) = smallest prime that is the concatenation of two numbers whose product is n.A087557
a(n) = smallest prime that is the concatenation of two numbers whose product is n.
- a(n) = largest prime that is the concatenation of two numbers whose product is n.A087558
a(n) = largest prime that is the concatenation of two numbers whose product is n.
- Rearrangement of natural numbers such that n*a(n) + 1 is a prime.A087559
Rearrangement of natural numbers such that n*a(n) + 1 is a prime.
- Smallest m > n such that gcd(m, n^2) = n.A087560
Smallest m > n such that gcd(m, n^2) = n.