Sequences
392,541 sequences
- Least prime p introducing prime-difference pattern {d, 2*d}, where d = 2*n, i.e., {p, p+2*n, p+2*n+4*n} = {p, p+2*n, p+6*n} are consecutive primes.A079011
Least prime p introducing prime-difference pattern {d, 2*d}, where d = 2*n, i.e., {p, p+2*n, p+2*n+4*n} = {p, p+2*n, p+6*n} are consecutive primes.
- Least prime p introducing prime-difference pattern {d, 2*d, 4*d}, where d = 2*n, i.e., {p, p+2*n, p+6*n, p+14*n} are consecutive primes.A079012
Least prime p introducing prime-difference pattern {d, 2*d, 4*d}, where d = 2*n, i.e., {p, p+2*n, p+6*n, p+14*n} are consecutive primes.
- Least prime p introducing prime-difference pattern {d, 2*d, 4*d, 8*d}, where d = 2*n, i.e., {p, p+2*n, p+6*n, p+14*n, p+30*n} are consecutive primes.A079013
Least prime p introducing prime-difference pattern {d, 2*d, 4*d, 8*d}, where d = 2*n, i.e., {p, p+2*n, p+6*n, p+14*n, p+30*n} are consecutive primes.
- a(n) is the least prime initiating consecutive prime difference pattern consisting of n increasing consecutive powers of 2 started with 2.A079014
a(n) is the least prime initiating consecutive prime difference pattern consisting of n increasing consecutive powers of 2 started with 2.
- Primes introducing consecutive prime 6-tuple of primes or 5-tuple corresponding consecutive p-difference pattern as follows: {d, 2*d, 4*d, 8*d, 16*d}.A079015
Primes introducing consecutive prime 6-tuple of primes or 5-tuple corresponding consecutive p-difference pattern as follows: {d, 2*d, 4*d, 8*d, 16*d}.
- Suppose p and q = p+12 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 14 possible difference patterns, namely [12], [2,10], [4,8], [6,6], [8,4], [10,2], [2,4,6], [2,6,4], [4,2,6], [4,6,2], [6,2,4], [6,4,2], [2,4,2,4] and [4,2,4,2]. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.A079016
Suppose p and q = p+12 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 14 possible difference patterns, namely [12], [2,10], [4,8], [6,6], [8,4], [10,2], [2,4,6], [2,6,4], [4,2,6], [4,6,2], [6,2,4], [6,4,2], [2,4,2,4] and [4,2,4,2]. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.
- Suppose p and q = p+14 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 15 possible difference patterns, namely [14], [2,12], [6,8], [8,6], [12,2], [2,4,8], [2,6,6], [2,10,2], [6,2,6], [6,6,2], [8,4,2], [2,4,6,2], [2,6,4,2], [2,2,4,2,4], [2,4,2,4,2]. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.A079017
Suppose p and q = p+14 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 15 possible difference patterns, namely [14], [2,12], [6,8], [8,6], [12,2], [2,4,8], [2,6,6], [2,10,2], [6,2,6], [6,6,2], [8,4,2], [2,4,6,2], [2,6,4,2], [2,2,4,2,4], [2,4,2,4,2]. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.
- Suppose p and q = p+16 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 17 possible difference patterns, namely [16], [4,12], [6,10], [10,6], [12,4], [4,2,10], [4,6,6], [4,8,4], [6,4,6], [6,6,4], [10,2,4], [4,2,4,6], [4,2,6,4], [4,6,2,4], [6,4,2,4], [4,2,4,2,4], [2,2,4,2,4,2]. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.A079018
Suppose p and q = p+16 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 17 possible difference patterns, namely [16], [4,12], [6,10], [10,6], [12,4], [4,2,10], [4,6,6], [4,8,4], [6,4,6], [6,6,4], [10,2,4], [4,2,4,6], [4,2,6,4], [4,6,2,4], [6,4,2,4], [4,2,4,2,4], [2,2,4,2,4,2]. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.
- Suppose p and q = p+18 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 49 possible difference patterns, shown in the Comments line. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.A079019
Suppose p and q = p+18 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 49 possible difference patterns, shown in the Comments line. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.
- Suppose p and q = p+20 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 56 possible difference patterns, shown in the Comments line. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.A079020
Suppose p and q = p+20 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 56 possible difference patterns, shown in the Comments line. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.
- Suppose p and q = p+22 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 51 possible difference patterns, shown in the Comments line. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.A079021
Suppose p and q = p+22 are primes. Define the difference pattern of (p,q) to be the successive differences of the primes in the range p to q. There are 51 possible difference patterns, shown in the Comments line. Sequence gives smallest value of p for each difference pattern, sorted by magnitude.
- Suppose p and q = p + 2*n are primes. Define the difference pattern of (p, q) to be the successive differences of the primes in the range p to q. There are a(n) possible difference patterns.A079022
Suppose p and q = p + 2*n are primes. Define the difference pattern of (p, q) to be the successive differences of the primes in the range p to q. There are a(n) possible difference patterns.
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; then a(n) is the number of partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p <= A000230(n).A079023
Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; then a(n) is the number of partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p <= A000230(n).
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; a(n) is the number of distinct partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p<=A000230(n). Multiple occurrences of a partition are not counted.A079024
Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; a(n) is the number of distinct partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p<=A000230(n). Multiple occurrences of a partition are not counted.
- Triangular array read by rows: column sums of frequency distributions associated with number of divisors of least prime signatures.A079025
Triangular array read by rows: column sums of frequency distributions associated with number of divisors of least prime signatures.
- Numbers that can be represented as 2*p + 3*q, where p and q are prime.A079026
Numbers that can be represented as 2*p + 3*q, where p and q are prime.
- a(n) = det(M(n)) where M(n) is the n X n matrix defined by m(i,i)=6, m(i,j)=i/j.A079027
a(n) = det(M(n)) where M(n) is the n X n matrix defined by m(i,i)=6, m(i,j)=i/j.
- a(0) = 1, a(n) = (n + 4)*4^(n-1) for n >= 1.A079028
a(0) = 1, a(n) = (n + 4)*4^(n-1) for n >= 1.
- Least k such that the class number of quadratic order of discriminant D=-4k equals p, where p runs through the primes.A079029
Least k such that the class number of quadratic order of discriminant D=-4k equals p, where p runs through the primes.
- Least k such that the class number of quadratic order of discriminant D=-4k equals n.A079030
Least k such that the class number of quadratic order of discriminant D=-4k equals n.
- Least k > n such that p(n) divides p(k), where p(k) denotes the k-th partition number (A000041).A079031
Least k > n such that p(n) divides p(k), where p(k) denotes the k-th partition number (A000041).
- Smallest nontrivial partition number divisible by the n-th partition number.A079032
Smallest nontrivial partition number divisible by the n-th partition number.
- First differences of A023203.A079033
First differences of A023203.
- Determinant of M(n), the n X n matrix defined by m(i,i) = 1, m(i,j) = i-j.A079034
Determinant of M(n), the n X n matrix defined by m(i,i) = 1, m(i,j) = i-j.
- Squares, not ending in zero, in which all the digits occur in groups of 2 or more.A079035
Squares, not ending in zero, in which all the digits occur in groups of 2 or more.
- Squares of these numbers have all their digits occurring in groups of 2 or more, without ending in zero.A079036
Squares of these numbers have all their digits occurring in groups of 2 or more, without ending in zero.
- a(0)=1; a(n) is the smallest integer > a(n-1) such that sin(a(n)) is closer to an integer (here 0 or -1) than sin(a(n-1)).A079037
a(0)=1; a(n) is the smallest integer > a(n-1) such that sin(a(n)) is closer to an integer (here 0 or -1) than sin(a(n-1)).
- Fractional part of sinh(n) decreases monotonically to zero.A079038
Fractional part of sinh(n) decreases monotonically to zero.
- Fractional part of cosh(n) decreases monotonically to zero.A079039
Fractional part of cosh(n) decreases monotonically to zero.
- Fractional part of 1/(1-tanh(n)) decreases monotonically to zero.A079040
Fractional part of 1/(1-tanh(n)) decreases monotonically to zero.
- Numbers n in which the first k digits of n form an integer divisible by k^3, for k = 1, 2, ..., m, where m is the number of digits in n.A079041
Numbers n in which the first k digits of n form an integer divisible by k^3, for k = 1, 2, ..., m, where m is the number of digits in n.
- Numbers n in which the first k digits of n form an integer divisible by k^2, for k = 1, 2, ..., m, where m is the number of digits in n.A079042
Numbers n in which the first k digits of n form an integer divisible by k^2, for k = 1, 2, ..., m, where m is the number of digits in n.
- a(0)=1, then the fractional part of Pi*a(n) decreases monotonically to zero.A079043
a(0)=1, then the fractional part of Pi*a(n) decreases monotonically to zero.
- Numbers k such that Sum_{j=0..k} sin(j/Pi) < 0.A079044
Numbers k such that Sum_{j=0..k} sin(j/Pi) < 0.
- Coefficients of the polynomials in the numerator of the generating function f(x)=(x-x^2)/(x^3-2x^2-2x+1) for F(n)^2, (where F(n) is the Fibonacci sequence) and its successive derivatives starting with the constant.A079045
Coefficients of the polynomials in the numerator of the generating function f(x)=(x-x^2)/(x^3-2x^2-2x+1) for F(n)^2, (where F(n) is the Fibonacci sequence) and its successive derivatives starting with the constant.
- Coefficients of the polynomials in the numerator of the generating function f(x)=(x-x^2)/(x^3-2x^2-2x+1) for F(n)^2, (where F(n) is the Fibonacci sequence) and its successive derivatives starting with the highest power of x.A079046
Coefficients of the polynomials in the numerator of the generating function f(x)=(x-x^2)/(x^3-2x^2-2x+1) for F(n)^2, (where F(n) is the Fibonacci sequence) and its successive derivatives starting with the highest power of x.
- Number of primes between prime(n) and prime(n)^2.A079047
Number of primes between prime(n) and prime(n)^2.
- Numerical equivalents of the words zero, one, two, three, ... on touch-tone telephone.A079048
Numerical equivalents of the words zero, one, two, three, ... on touch-tone telephone.
- Recamán variation: a(1) = 1; for n > 1, a(n) = a(n-1)-prime(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1)+prime(n).A079049
Recamán variation: a(1) = 1; for n > 1, a(n) = a(n-1)-prime(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1)+prime(n).
- Sum of the digits of LookAndSay(n).A079050
Sum of the digits of LookAndSay(n).
- Recamán variation: a(0) = 0; for n >= 1, a(n) = a(n-1) - f(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1) + f(n), where f(n) = floor(sqrt(n)) (A000196).A079051
Recamán variation: a(0) = 0; for n >= 1, a(n) = a(n-1) - f(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1) + f(n), where f(n) = floor(sqrt(n)) (A000196).
- Recamán variation: a(1) = 1; for n > 1, a(n) = a(n-1)-f(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1)+f(n), where f(n)=phi(n) (cf. A000010).A079052
Recamán variation: a(1) = 1; for n > 1, a(n) = a(n-1)-f(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1)+f(n), where f(n)=phi(n) (cf. A000010).
- Recamán Fibonacci variation: a(1)=1; a(2)=2; for n > 2, a(n) = a(n-1)+a(n-2)-F(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1)+a(n-2)+F(n) where F(n) denotes the n-th Fibonacci number.A079053
Recamán Fibonacci variation: a(1)=1; a(2)=2; for n > 2, a(n) = a(n-1)+a(n-2)-F(n) if that number is positive and not already in the sequence, otherwise a(n) = a(n-1)+a(n-2)+F(n) where F(n) denotes the n-th Fibonacci number.
- a(n) = -1 if the closest prime to prime(n) is prime(n-1); = 1 if the closest prime to prime(n) is prime(n+1); = 0 if prime(n-1) and prime(n+1) are equally close to prime(n).A079054
a(n) = -1 if the closest prime to prime(n) is prime(n-1); = 1 if the closest prime to prime(n) is prime(n+1); = 0 if prime(n-1) and prime(n+1) are equally close to prime(n).
- Numbers of prime pairs (p,q), p<=q, such that (p+q) divides n.A079055
Numbers of prime pairs (p,q), p<=q, such that (p+q) divides n.
- Numbers of prime triples (p,q,r), p<=q<=r, such that (p+q+r) divides n.A079056
Numbers of prime triples (p,q,r), p<=q<=r, such that (p+q+r) divides n.
- a(n) = Sum_{k=1..n} bigomega(tau(k)).A079057
a(n) = Sum_{k=1..n} bigomega(tau(k)).
- Least k > 0 such that A025591(k) >= p(n) (p(n)=the n-th partition number).A079058
Least k > 0 such that A025591(k) >= p(n) (p(n)=the n-th partition number).
- Decimal expansion of product( p == 3 (mod 4), sqrt(1-p^-2)).A079059
Decimal expansion of product( p == 3 (mod 4), sqrt(1-p^-2)).
- Least k such that the least positive primitive root of prime(k) equals prime(n).A079060
Least k such that the least positive primitive root of prime(k) equals prime(n).