Sequences
392,541 sequences
- Rearrangement of even numbers such that a(k) + a(k+1) + 1 is a prime for all k.A073661
Rearrangement of even numbers such that a(k) + a(k+1) + 1 is a prime for all k.
- Rearrangement of even numbers such that a(k)*a(k+1) + 1 is a prime for all k.A073662
Rearrangement of even numbers such that a(k)*a(k+1) + 1 is a prime for all k.
- Total number of branches of length k (k>=1) in all ordered trees with n+k edges (it is independent of k).A073663
Total number of branches of length k (k>=1) in all ordered trees with n+k edges (it is independent of k).
- Even numbers which retain their relative position in A073661 (are not disturbed in the rearrangement process).A073664
Even numbers which retain their relative position in A073661 (are not disturbed in the rearrangement process).
- Rearrangement of even numbers such that a(n) + a(n+1) + 1 and a(n)*a(n+1) + 1 are primes for all n.A073665
Rearrangement of even numbers such that a(n) + a(n+1) + 1 and a(n)*a(n+1) + 1 are primes for all n.
- Rearrangement of natural numbers such that a(k)*a(k+1) + 1 is a prime for all k.A073666
Rearrangement of natural numbers such that a(k)*a(k+1) + 1 is a prime for all k.
- Numbers which retain their position in A073666 (position not disturbed by the rearrangement).A073667
Numbers which retain their position in A073666 (position not disturbed by the rearrangement).
- Decimal expansion of Sum_{k>=1} 1/(10^k - 1).A073668
Decimal expansion of Sum_{k>=1} 1/(10^k - 1).
- a(1) = 1, a(n) = the smallest composite multiple of n such that every partial sum is prime.A073669
a(1) = 1, a(n) = the smallest composite multiple of n such that every partial sum is prime.
- a(1) = 1, a(n) = the smallest composite multiple of n not included earlier such that every partial sum is prime.A073670
a(1) = 1, a(n) = the smallest composite multiple of n not included earlier such that every partial sum is prime.
- Rearrangement of odd numbers such that sum of any three consecutive terms is prime.A073671
Rearrangement of odd numbers such that sum of any three consecutive terms is prime.
- Rearrangement of natural numbers such that sum of n (n>1) terms starting from the n-th term (included) is a prime.A073672
Rearrangement of natural numbers such that sum of n (n>1) terms starting from the n-th term (included) is a prime.
- Rearrangement of natural numbers such that every partial product + 1 is a prime.A073673
Rearrangement of natural numbers such that every partial product + 1 is a prime.
- Rearrangement of odd numbers such that every partial product + 2 is a prime.A073674
Rearrangement of odd numbers such that every partial product + 2 is a prime.
- Rearrangement of natural numbers such that a(n) is the smallest proper divisor of n not included earlier but if no such divisor exists then a(n) is the smallest proper multiple of n not included earlier, subject always to the condition that a(n) is not equal to n.A073675
Rearrangement of natural numbers such that a(n) is the smallest proper divisor of n not included earlier but if no such divisor exists then a(n) is the smallest proper multiple of n not included earlier, subject always to the condition that a(n) is not equal to n.
- Rearrangement of odd numbers not divisible by 5 such that every right concatenation of terms is a prime.A073676
Rearrangement of odd numbers not divisible by 5 such that every right concatenation of terms is a prime.
- Rearrangement of the odd positive integers such that right concatenation of first 2m terms is prime, while a(2k+1) = 10k+5.A073677
Rearrangement of the odd positive integers such that right concatenation of first 2m terms is prime, while a(2k+1) = 10k+5.
- Lexically least rearrangement of natural numbers such that the least common multiple of the first n terms, plus one, is prime.A073678
Lexically least rearrangement of natural numbers such that the least common multiple of the first n terms, plus one, is prime.
- a(1) = 4, a(n+1) is the smallest composite number > a(n) such that all of the differences a(n+1)-a(n) are distinct primes.A073679
a(1) = 4, a(n+1) is the smallest composite number > a(n) such that all of the differences a(n+1)-a(n) are distinct primes.
- a(1) =2, a(2) = 3, a(n+2) = smallest prime such that a(n+2) - a(n+1) is a multiple of a(n).A073680
a(1) =2, a(2) = 3, a(n+2) = smallest prime such that a(n+2) - a(n+1) is a multiple of a(n).
- Smallest of three consecutive primes whose sum is a prime.A073681
Smallest of three consecutive primes whose sum is a prime.
- Prime sum of n-th group of successive primes in A073684.A073682
Prime sum of n-th group of successive primes in A073684.
- Group the primes such that the sum of each group is a prime. Each group from the second onwards should contain at least 3 primes: (2, 3), (5, 7, 11), (13, 17, 19, 23, 29), (31, 37, 41), (43, 47, 53, 59, 61), ... This is the sequence of the leading element in each group.A073683
Group the primes such that the sum of each group is a prime. Each group from the second onwards should contain at least 3 primes: (2, 3), (5, 7, 11), (13, 17, 19, 23, 29), (31, 37, 41), (43, 47, 53, 59, 61), ... This is the sequence of the leading element in each group.
- Sum of next a(n) successive primes is prime.A073684
Sum of next a(n) successive primes is prime.
- Group the composite numbers so that the sum of each group is a prime, sequence gives number of terms in each group.A073685
Group the composite numbers so that the sum of each group is a prime, sequence gives number of terms in each group.
- Group the composite numbers so that the sum of each group is a prime; sequence gives sum of terms in each group.A073686
Group the composite numbers so that the sum of each group is a prime; sequence gives sum of terms in each group.
- Group the composite numbers so that the sum of each group is a prime; sequence gives first term in each group.A073687
Group the composite numbers so that the sum of each group is a prime; sequence gives first term in each group.
- Group the natural numbers so that the product of the terms in each group + 1 is a prime: (1), (2), (3, 4), (5, 6), (7, 8, 9, 10, 11), (12), (13, 14, 15), (16), ... This is the sequence of such primes.A073688
Group the natural numbers so that the product of the terms in each group + 1 is a prime: (1), (2), (3, 4), (5, 6), (7, 8, 9, 10, 11), (12), (13, 14, 15), (16), ... This is the sequence of such primes.
- Group the natural numbers so that the product of the terms in each group + 1 is a prime: (1), (2), (3, 4), (5, 6), (7, 8, 9, 10, 11), (12), (13, 14, 15), (16), ... Sequence gives first term in each group.A073689
Group the natural numbers so that the product of the terms in each group + 1 is a prime: (1), (2), (3, 4), (5, 6), (7, 8, 9, 10, 11), (12), (13, 14, 15), (16), ... Sequence gives first term in each group.
- Group the natural numbers so that the product of the terms in each group + 1 is a prime: (1), (2), (3, 4), (5, 6), (7, 8, 9, 10, 11), (12), (13, 14, 15), (16), ... This is the sequence of the number of terms in each group.A073690
Group the natural numbers so that the product of the terms in each group + 1 is a prime: (1), (2), (3, 4), (5, 6), (7, 8, 9, 10, 11), (12), (13, 14, 15), (16), ... This is the sequence of the number of terms in each group.
- Primes p = product(A073692(n), A073692(n)+2,..., A073692(n+1)-2) plus 2.A073691
Primes p = product(A073692(n), A073692(n)+2,..., A073692(n+1)-2) plus 2.
- a(0)=1; for n > 0, a(n) is the smallest odd number k such that (2 + Product_{j=a(n-1)..k-2, j odd} j) is prime.A073692
a(0)=1; for n > 0, a(n) is the smallest odd number k such that (2 + Product_{j=a(n-1)..k-2, j odd} j) is prime.
- Product of next a(n) odd numbers plus 2 is prime.A073693
Product of next a(n) odd numbers plus 2 is prime.
- Numbers k such that the number of divisors of k equals the number of anti-divisors of k.A073694
Numbers k such that the number of divisors of k equals the number of anti-divisors of k.
- Primes arising in A073697.A073695
Primes arising in A073697.
- Initial members of groups in A073697.A073696
Initial members of groups in A073697.
- Group the even numbers so that the product of the terms in each group + 1 is a prime: (2), (4), (6), (8, 10, 12, 14), (16), (18), ... Sequence gives number of terms in each group.A073697
Group the even numbers so that the product of the terms in each group + 1 is a prime: (2), (4), (6), (8, 10, 12, 14), (16), (18), ... Sequence gives number of terms in each group.
- a(n) is smallest prime not already in the sequence such that the sum of the first n terms is an n-th power.A073698
a(n) is smallest prime not already in the sequence such that the sum of the first n terms is an n-th power.
- Floor((Product of composite numbers up to n)/(product of primes up to n)).A073699
Floor((Product of composite numbers up to n)/(product of primes up to n)).
- a(1) = 1, a(n) = Floor[(Sum of composite numbers up to n)/(Sum of primes up to n)].A073700
a(1) = 1, a(n) = Floor[(Sum of composite numbers up to n)/(Sum of primes up to n)].
- a(n) = n^2*a(n-1)+(-1)^n.A073701
a(n) = n^2*a(n-1)+(-1)^n.
- a(n) = A073145(n)^2.A073702
a(n) = A073145(n)^2.
- Smallest prime p such that also p+prime(n)*2 is a prime.A073703
Smallest prime p such that also p+prime(n)*2 is a prime.
- Smallest prime p such that also p-prime(n)*2 is a prime.A073704
Smallest prime p such that also p-prime(n)*2 is a prime.
- a(n) = Sum_{ d divides n } (n/d)^(2d).A073705
a(n) = Sum_{ d divides n } (n/d)^(2d).
- a(n) = Sum_{ d divides n } (n/d)^(3d).A073706
a(n) = Sum_{ d divides n } (n/d)^(3d).
- Coefficients of a power series whose convolution consists of only the even-indexed terms of the sequence.A073707
Coefficients of a power series whose convolution consists of only the even-indexed terms of the sequence.
- Generating function A(x) satisfies A(x) = (1+x)^2*A(x^2)^2, with A(0)=1.A073708
Generating function A(x) satisfies A(x) = (1+x)^2*A(x^2)^2, with A(0)=1.
- First differences of A073708.A073709
First differences of A073708.
- Convolution of A073709, which is also the first differences of the unique terms of A073709.A073710
Convolution of A073709, which is also the first differences of the unique terms of A073709.