Sequences
392,541 sequences
- Smallest m such that there are n primes of the form m-p where p is a prime. Index of the first occurrence of n in A073610.A073611
Smallest m such that there are n primes of the form m-p where p is a prime. Index of the first occurrence of n in A073610.
- Group the positive integers as (1, 2), (3, 4, 5), (6, 7, 8, 9, 10), (11, 12, 13, 14, 15, 16, 17), ... the n-th group containing prime(n) elements. Except the first, all groups contain an odd number of elements and hence have a middle term. Sequence gives the middle terms starting from group 2.A073612
Group the positive integers as (1, 2), (3, 4, 5), (6, 7, 8, 9, 10), (11, 12, 13, 14, 15, 16, 17), ... the n-th group containing prime(n) elements. Except the first, all groups contain an odd number of elements and hence have a middle term. Sequence gives the middle terms starting from group 2.
- Triangular numbers which are the sum of two squares.A073613
Triangular numbers which are the sum of two squares.
- Numbers m such that m*(prime(m)+1) is a square.A073614
Numbers m such that m*(prime(m)+1) is a square.
- Let p(k) denote the k-th prime; a(n) = smallest p(m) > p(n) such that the n-1 differences between [p(n), p(n+1), ..., p(2n-1)] are the same as the n-1 differences between [p(m), p(m+1), ..., p(m+n-1)].A073615
Let p(k) denote the k-th prime; a(n) = smallest p(m) > p(n) such that the n-1 differences between [p(n), p(n+1), ..., p(2n-1)] are the same as the n-1 differences between [p(m), p(m+1), ..., p(m+n-1)].
- a(n) = Sum_{k=0..n} lpf(binomial(n, k)), where lpf(m) is the least prime factor of m.A073616
a(n) = Sum_{k=0..n} lpf(binomial(n, k)), where lpf(m) is the least prime factor of m.
- Consider Pascal's triangle A007318; a(n) = product of terms at +45 degrees slope with the horizontal.A073617
Consider Pascal's triangle A007318; a(n) = product of terms at +45 degrees slope with the horizontal.
- Consider Pascal's triangle A007318; a(n) = LCM of terms at +45 degree slope with the horizontal.A073618
Consider Pascal's triangle A007318; a(n) = LCM of terms at +45 degree slope with the horizontal.
- a(1) = 0; a(n) = smallest composite number which is a sum of n distinct primes.A073619
a(1) = 0; a(n) = smallest composite number which is a sum of n distinct primes.
- a(1) = 0; a(n) = smallest prime number which is a sum of n distinct composite numbers.A073620
a(1) = 0; a(n) = smallest prime number which is a sum of n distinct composite numbers.
- Smallest composite number which is a sum of n distinct composite numbers.A073621
Smallest composite number which is a sum of n distinct composite numbers.
- Primes ordered so that their most significant digits form the digits of Pi.A073622
Primes ordered so that their most significant digits form the digits of Pi.
- Primes ordered so that their most significant digits form the digits of e.A073623
Primes ordered so that their most significant digits form the digits of e.
- Primes ordered so that their most significant digits form the digits of Euler-Mascheroni constant .5772156649...A073624
Primes ordered so that their most significant digits form the digits of Euler-Mascheroni constant .5772156649...
- Primes ordered so that their most significant digits form the digits of golden ratio phi= 1.6180339887...A073625
Primes ordered so that their most significant digits form the digits of golden ratio phi= 1.6180339887...
- Primes ordered so that their most significant digits form the digits of sqrt(2)=1.41421356237309504880...A073626
Primes ordered so that their most significant digits form the digits of sqrt(2)=1.41421356237309504880...
- a(1)=a(2)=1; for n > 2, a(n) is the smallest integer such that a(n) > a(n-1) and a(n)+a(n-1) is prime.A073627
a(1)=a(2)=1; for n > 2, a(n) is the smallest integer such that a(n) > a(n-1) and a(n)+a(n-1) is prime.
- a(0) = 0; a(1) = 1; a(2) = 2; a(n) = smallest number greater than the previous term such that the sum of three successive terms is a prime.A073628
a(0) = 0; a(1) = 1; a(2) = 2; a(n) = smallest number greater than the previous term such that the sum of three successive terms is a prime.
- a(1) = 1; a(2) =2; a(3) = 3; a(n) = smallest number greater than the previous term such that the sum of four successive terms is a prime.A073629
a(1) = 1; a(2) =2; a(3) = 3; a(n) = smallest number greater than the previous term such that the sum of four successive terms is a prime.
- Numbers k such that k*(prime(k) - 1) is a square.A073630
Numbers k such that k*(prime(k) - 1) is a square.
- Nonprimes k such that k divides 3^(k-1) - 2^(k-1).A073631
Nonprimes k such that k divides 3^(k-1) - 2^(k-1).
- Numbers k such that floor((3/2)^k) = A002379(k) is odd.A073632
Numbers k such that floor((3/2)^k) = A002379(k) is odd.
- Numbers k that divide floor((3/2)^k) = A002379(k).A073633
Numbers k that divide floor((3/2)^k) = A002379(k).
- Numbers k such that floor((3/2)^k) = A002379(k) is even.A073634
Numbers k such that floor((3/2)^k) = A002379(k) is even.
- Duplicate of A071532.A073635
Duplicate of A071532.
- Period 3: repeat [1, 8, 9] ; Digital root of A000578(n) = n^3 for n >= 1.A073636
Period 3: repeat [1, 8, 9] ; Digital root of A000578(n) = n^3 for n >= 1.
- Digital root (cf. A010888) of prime(n)^3.A073637
Digital root (cf. A010888) of prime(n)^3.
- Number of anti-divisors of n (A066272) sets a record.A073638
Number of anti-divisors of n (A066272) sets a record.
- Numbers k such that x^k + x + 1 is a primitive polynomial modulo 2.A073639
Numbers k such that x^k + x + 1 is a primitive polynomial modulo 2.
- a(1) = 2; a(n) = smallest prime greater than the previous term such that concatenation of two successive terms is a prime.A073640
a(1) = 2; a(n) = smallest prime greater than the previous term such that concatenation of two successive terms is a prime.
- a(1) = 2; a(n) = smallest prime not included earlier such that concatenation of two successive terms is a prime.A073641
a(1) = 2; a(n) = smallest prime not included earlier such that concatenation of two successive terms is a prime.
- Replace 2^k in the binary representation of n with k (i.e., if n = 2^b + 2^c + 2^d + ... then a(n) = b + c + d + ...).A073642
Replace 2^k in the binary representation of n with k (i.e., if n = 2^b + 2^c + 2^d + ... then a(n) = b + c + d + ...).
- Nine-digit primes with all distinct digits.A073643
Nine-digit primes with all distinct digits.
- Largest k such that the harmonic mean of phi(n), phi(n+1), ...., phi(n+x) is an integer for any x with 0<=x<=k.A073644
Largest k such that the harmonic mean of phi(n), phi(n+1), ...., phi(n+x) is an integer for any x with 0<=x<=k.
- a(1)=2 and, for all n>=1, a(n) is the length of the n-th run of increasing consecutive integers with each run after the first starting with 1.A073645
a(1)=2 and, for all n>=1, a(n) is the length of the n-th run of increasing consecutive integers with each run after the first starting with 1.
- Least number formed by concatenating the prime factors of n in base 10.A073646
Least number formed by concatenating the prime factors of n in base 10.
- In decimal representation of n, replace composite digits (4, 6, 8 and 9) with their concatenated prime factorizations (22, 23, 222 and 33).A073647
In decimal representation of n, replace composite digits (4, 6, 8 and 9) with their concatenated prime factorizations (22, 23, 222 and 33).
- Middle members of prime triples {p, p+2, p+6}.A073648
Middle members of prime triples {p, p+2, p+6}.
- Define the composite field of a prime q to be f(q) = (t,s) if p, q, r are three consecutive primes and q-p = t and r-q = s. This is a sequence of primes q with field (4,2).A073649
Define the composite field of a prime q to be f(q) = (t,s) if p, q, r are three consecutive primes and q-p = t and r-q = s. This is a sequence of primes q with field (4,2).
- Define the composite field of a prime q to be f(q) = (t,s) if p, q, r are three consecutive primes and q-p = t and r-q = s. This is a sequence of primes q with field (2,6).A073650
Define the composite field of a prime q to be f(q) = (t,s) if p, q, r are three consecutive primes and q-p = t and r-q = s. This is a sequence of primes q with field (2,6).
- Define the composite field of a prime q to be f(q) = (t,s) if p, q, r are three consecutive primes and q-p = t and r-q = s. This is a sequence of primes q with field (6,2).A073651
Define the composite field of a prime q to be f(q) = (t,s) if p, q, r are three consecutive primes and q-p = t and r-q = s. This is a sequence of primes q with field (6,2).
- Primes which occur as the difference of consecutive prime powers >1 as and when they occur.A073652
Primes which occur as the difference of consecutive prime powers >1 as and when they occur.
- a(1)=3, a(2)=5; for n > 2, a(n) = smallest prime not included earlier such that a(n-2) + a(n-1) + a(n) is a prime.A073653
a(1)=3, a(2)=5; for n > 2, a(n) = smallest prime not included earlier such that a(n-2) + a(n-1) + a(n) is a prime.
- A073653 is defined to be 'rearrangement of odd primes such that sum of three consecutive terms is a prime'. This is the sequence of those primes whose relative position is not disturbed in this rearrangement.A073654
A073653 is defined to be 'rearrangement of odd primes such that sum of three consecutive terms is a prime'. This is the sequence of those primes whose relative position is not disturbed in this rearrangement.
- Rearrangement of triangular numbers such that sum of two consecutive terms is a prime.A073655
Rearrangement of triangular numbers such that sum of two consecutive terms is a prime.
- Rearrangement of Fibonacci numbers such that sum of two consecutive terms is a prime.A073656
Rearrangement of Fibonacci numbers such that sum of two consecutive terms is a prime.
- A073656 is the rearrangement of Fibonacci numbers such that sum of two consecutive terms is a prime. This is the sequence of those Fibonacci numbers which retain their relative position in the above rearrangement.A073657
A073656 is the rearrangement of Fibonacci numbers such that sum of two consecutive terms is a prime. This is the sequence of those Fibonacci numbers which retain their relative position in the above rearrangement.
- Rearrangement of squares such that sum of two consecutive terms is a prime.A073658
Rearrangement of squares such that sum of two consecutive terms is a prime.
- a(1) = 1; for n > 1, a(n) is the smallest even number not already in the sequence such that a(1) + ... + a(n) is a prime.A073659
a(1) = 1; for n > 1, a(n) is the smallest even number not already in the sequence such that a(1) + ... + a(n) is a prime.
- Terms of A073659 which retain their relative positions.A073660
Terms of A073659 which retain their relative positions.