Sequences
392,541 sequences
- Primes that are the sum of two squares and which set a record for the gap to the next prime of that form.A084161
Primes that are the sum of two squares and which set a record for the gap to the next prime of that form.
- a(n) is the length of the gap in sequence A084161.A084162
a(n) is the length of the gap in sequence A084161.
- Primes which are -1 mod m, where m is the index of the prime in sequence A002313 (Real primes with corresponding complex primes). The index m can be found in A084164 Primes which are 1 mod m can be found in sequence A084165.A084163
Primes which are -1 mod m, where m is the index of the prime in sequence A002313 (Real primes with corresponding complex primes). The index m can be found in A084164 Primes which are 1 mod m can be found in sequence A084165.
- Index of the primes in A084163.A084164
Index of the primes in A084163.
- Primes which are 1 mod m, where m is the index of the prime in sequence A002313 (Real primes with corresponding complex primes). The index m can be found in A084166 Primes which are -1 mod m can be found in sequence A084163.A084165
Primes which are 1 mod m, where m is the index of the prime in sequence A002313 (Real primes with corresponding complex primes). The index m can be found in A084166 Primes which are -1 mod m can be found in sequence A084163.
- Index of the primes in A084165.A084166
Index of the primes in A084165.
- Numbers k in A002313 such that the count of primitive roots of k (A084168) are also in sequence A002313, where A002313 is the list of primes p having a unique representation as the sum of two squares, p = x^2 + y^2.A084167
Numbers k in A002313 such that the count of primitive roots of k (A084168) are also in sequence A002313, where A002313 is the list of primes p having a unique representation as the sum of two squares, p = x^2 + y^2.
- Number of primitive roots p = 2 or 1 mod 4 of elements in A084167.A084168
Number of primitive roots p = 2 or 1 mod 4 of elements in A084167.
- A Pell Jacobsthal product.A084169
A Pell Jacobsthal product.
- a(n) = (5*2^n + (-1)^n - 3)/3.A084170
a(n) = (5*2^n + (-1)^n - 3)/3.
- Binomial transform of generalized Jacobsthal numbers A084170.A084171
Binomial transform of generalized Jacobsthal numbers A084170.
- a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).A084172
a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).
- a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).A084173
a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).
- a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).A084174
a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).
- Jacobsthal oblong numbers.A084175
Jacobsthal oblong numbers.
- Sums of two Fibonacci numbers (allowing 0 as a summand).A084176
Sums of two Fibonacci numbers (allowing 0 as a summand).
- Binomial transform of Jacobsthal oblongs.A084177
Binomial transform of Jacobsthal oblongs.
- Inverse binomial transform of Fibonacci oblongs.A084178
Inverse binomial transform of Fibonacci oblongs.
- Expansion of the g.f. x/((1+2x)(1-x-x^2)).A084179
Expansion of the g.f. x/((1+2x)(1-x-x^2)).
- Duplicate of A020988.A084180
Duplicate of A020988.
- 2^n+(-2)^n-(-1)^n.A084181
2^n+(-2)^n-(-1)^n.
- a(n) = 3^n + (-1)^n - [1/(n+1)], where [] represents the floor function.A084182
a(n) = 3^n + (-1)^n - [1/(n+1)], where [] represents the floor function.
- Jacobsthal reverse-pair sequence.A084183
Jacobsthal reverse-pair sequence.
- Partial sums of a Jacobsthal related sequence.A084184
Partial sums of a Jacobsthal related sequence.
- First occurrence of binary n in the binary expansion of sqrt(2).A084185
First occurrence of binary n in the binary expansion of sqrt(2).
- First occurrence of exactly n 1's in the binary expansion of sqrt(2).A084186
First occurrence of exactly n 1's in the binary expansion of sqrt(2).
- First occurrence of exactly n 0's in the binary expansion of sqrt(2).A084187
First occurrence of exactly n 0's in the binary expansion of sqrt(2).
- a(0)=1, a(n+1) = 2*a(n) + b(n+2), where b(n)=A004539(n) is the n-th bit in the binary expansion of sqrt(2).A084188
a(0)=1, a(n+1) = 2*a(n) + b(n+2), where b(n)=A004539(n) is the n-th bit in the binary expansion of sqrt(2).
- Minimum digit out of both prime factors of the numbers in A046376.A084189
Minimum digit out of both prime factors of the numbers in A046376.
- Least common multiple of {d-1: d > 1 and d divides n}.A084190
Least common multiple of {d-1: d > 1 and d divides n}.
- a(n) = A084190(A084190(n)).A084191
a(n) = A084190(A084190(n)).
- Array read by antidiagonals: T(n,k) = solution to postage stamp problem with n stamps and k denominations (n >= 1, k >= 1).A084192
Array read by antidiagonals: T(n,k) = solution to postage stamp problem with n stamps and k denominations (n >= 1, k >= 1).
- Array read by antidiagonals: T(k,n) = solution to postage stamp problem with n stamps and k denominations (n >= 1, k >= 1).A084193
Array read by antidiagonals: T(k,n) = solution to postage stamp problem with n stamps and k denominations (n >= 1, k >= 1).
- Even numbers n such that the sum of the digits is prime and the sum of the digits of n/2 is also prime.A084194
Even numbers n such that the sum of the digits is prime and the sum of the digits of n/2 is also prime.
- Even numbers n such that the sum of the digits is prime, n/2 is prime and the sum of the digits of n/2 is also prime.A084195
Even numbers n such that the sum of the digits is prime, n/2 is prime and the sum of the digits of n/2 is also prime.
- Number of primes q<prime(n) such that q+1 divides prime(n)+1.A084196
Number of primes q<prime(n) such that q+1 divides prime(n)+1.
- Primes p such that there exists at least one prime q<p with q+1 dividing p+1.A084197
Primes p such that there exists at least one prime q<p with q+1 dividing p+1.
- Primes p such that there exists exactly one prime q<p with q+1 dividing p+1.A084198
Primes p such that there exists exactly one prime q<p with q+1 dividing p+1.
- Smallest prime q < prime(n) such that q+1 divides prime(n)+1, a(n) = 1 if no such q exists.A084199
Smallest prime q < prime(n) such that q+1 divides prime(n)+1, a(n) = 1 if no such q exists.
- LeastCommonMultiple{q+1: q prime, q < prime(n), q+1 divides prime(n)+1}.A084200
LeastCommonMultiple{q+1: q prime, q < prime(n), q+1 divides prime(n)+1}.
- Primes p such that the sum of the digits is prime and the sum of the digits of 2p is also prime.A084201
Primes p such that the sum of the digits is prime and the sum of the digits of 2p is also prime.
- G.f. A(x) defined by: A(x)^2 consists entirely of integer coefficients between 1 and 2 (A083952); A(x) is the unique power series solution with A(0)=1.A084202
G.f. A(x) defined by: A(x)^2 consists entirely of integer coefficients between 1 and 2 (A083952); A(x) is the unique power series solution with A(0)=1.
- G.f. A(x) defined by: A(x)^3 consists entirely of integer coefficients between 1 and 3 (A083953); A(x) is the unique power series solution with A(0)=1.A084203
G.f. A(x) defined by: A(x)^3 consists entirely of integer coefficients between 1 and 3 (A083953); A(x) is the unique power series solution with A(0)=1.
- G.f. A(x) defined by: A(x)^4 consists entirely of integer coefficients between 1 and 4 (A083954); A(x) is the unique power series solution with A(0)=1.A084204
G.f. A(x) defined by: A(x)^4 consists entirely of integer coefficients between 1 and 4 (A083954); A(x) is the unique power series solution with A(0)=1.
- G.f. A(x) defined by: A(x)^5 consists entirely of integer coefficients between 1 and 5 (A083945); A(x) is the unique power series solution with A(0)=1.A084205
G.f. A(x) defined by: A(x)^5 consists entirely of integer coefficients between 1 and 5 (A083945); A(x) is the unique power series solution with A(0)=1.
- G.f. A(x) defined by: A(x)^6 consists entirely of integer coefficients between 1 and 6 (A083946); A(x) is the unique power series solution with A(0)=1.A084206
G.f. A(x) defined by: A(x)^6 consists entirely of integer coefficients between 1 and 6 (A083946); A(x) is the unique power series solution with A(0)=1.
- G.f. A(x) defined by: A(x)^7 consists entirely of integer coefficients between 1 and 7 (A083947); A(x) is the unique power series solution with A(0)=1.A084207
G.f. A(x) defined by: A(x)^7 consists entirely of integer coefficients between 1 and 7 (A083947); A(x) is the unique power series solution with A(0)=1.
- G.f. A(x) defined by: A(x)^8 consists entirely of integer coefficients between 1 and 8 (A083948); A(x) is the unique power series solution with A(0)=1.A084208
G.f. A(x) defined by: A(x)^8 consists entirely of integer coefficients between 1 and 8 (A083948); A(x) is the unique power series solution with A(0)=1.
- G.f. A(x) defined by: A(x)^9 consists entirely of integer coefficients between 1 and 9 (A083949); A(x) is the unique power series solution with A(0)=1.A084209
G.f. A(x) defined by: A(x)^9 consists entirely of integer coefficients between 1 and 9 (A083949); A(x) is the unique power series solution with A(0)=1.
- G.f. A(x) defined by: A(x)^10 consists entirely of integer coefficients between 1 and 10 (A083950); A(x) is the unique power series solution with A(0)=1.A084210
G.f. A(x) defined by: A(x)^10 consists entirely of integer coefficients between 1 and 10 (A083950); A(x) is the unique power series solution with A(0)=1.