Sequences
392,541 sequences
- Numbers m such that A084110(m) = m.A084111
Numbers m such that A084110(m) = m.
- Nonprimes in A084111.A084112
Nonprimes in A084111.
- Number of multiplications when calculating A084110(n).A084113
Number of multiplications when calculating A084110(n).
- Number of divisions when calculating A084110(n).A084114
Number of divisions when calculating A084110(n).
- A084113(n) minus A084114(n).A084115
A084113(n) minus A084114(n).
- Numbers m such that A084115(m) = 1.A084116
Numbers m such that A084115(m) = 1.
- Multiplicity of the factor (1+x+x^2) in the characteristic polynomial modulo 2 of the symmetric matrix with entries binomial(i+j,i), 0<=i,j<n.A084117
Multiplicity of the factor (1+x+x^2) in the characteristic polynomial modulo 2 of the symmetric matrix with entries binomial(i+j,i), 0<=i,j<n.
- Continued fraction expansion of Product_{k>=0} (1 - 1/(2^k+1)).A084118
Continued fraction expansion of Product_{k>=0} (1 - 1/(2^k+1)).
- Decimal expansion of the Fibonacci binary number, Sum_{k>0} 1/2^F(k), where F(k) = A000045(k).A084119
Decimal expansion of the Fibonacci binary number, Sum_{k>0} 1/2^F(k), where F(k) = A000045(k).
- a(n) = 6*a(n-1) - 3*a(n-2), a(0)=1, a(1)=3.A084120
a(n) = 6*a(n-1) - 3*a(n-2), a(0)=1, a(1)=3.
- Primes p_n such that n*p_n is a palindrome.A084121
Primes p_n such that n*p_n is a palindrome.
- Numbers k such that k*prime(k) is a palindrome.A084122
Numbers k such that k*prime(k) is a palindrome.
- Palindromic numbers which are equal to a number n multiplied by the n-th prime.A084123
Palindromic numbers which are equal to a number n multiplied by the n-th prime.
- Numbers n such that 11*3^n + 2 is prime.A084124
Numbers n such that 11*3^n + 2 is prime.
- Numbers k such that 13*3^k + 2 is prime.A084125
Numbers k such that 13*3^k + 2 is prime.
- Prime factor <= other prime factor of n-th semiprime.A084126
Prime factor <= other prime factor of n-th semiprime.
- Prime factor >= other prime factor of n-th semiprime.A084127
Prime factor >= other prime factor of n-th semiprime.
- a(n) = 4*a(n-1) + 4*a(n-2), a(0)=1, a(1)=2.A084128
a(n) = 4*a(n-1) + 4*a(n-2), a(0)=1, a(1)=2.
- Continued fraction expansion of 4*Product_{k>=0} (1 - 1/(2^k+1)).A084129
Continued fraction expansion of 4*Product_{k>=0} (1 - 1/(2^k+1)).
- a(n) = 8*a(n-1) - 8*a(n-2), a(0)=1, a(1)=4.A084130
a(n) = 8*a(n-1) - 8*a(n-2), a(0)=1, a(1)=4.
- a(n) = 10*a(n-1) - 17*a(n-2), a(0) = 1, a(1) = 5.A084131
a(n) = 10*a(n-1) - 17*a(n-2), a(0) = 1, a(1) = 5.
- a(n) = 4*a(n-1) + 6*a(n-2), a(0)=1, a(1)=2.A084132
a(n) = 4*a(n-1) + 6*a(n-2), a(0)=1, a(1)=2.
- Duplicate of A005667.A084133
Duplicate of A005667.
- a(n) = 8*a(n-1) - 6*a(n-2), a(0) = 1, a(1) = 4.A084134
a(n) = 8*a(n-1) - 6*a(n-2), a(0) = 1, a(1) = 4.
- a(n) = 10*a(n-1) - 15*a(n-2), a(0)=1, a(1)=5.A084135
a(n) = 10*a(n-1) - 15*a(n-2), a(0)=1, a(1)=5.
- Binomial transform of cosh(sqrt(2)*x)^2.A084136
Binomial transform of cosh(sqrt(2)*x)^2.
- Binomial transform of A084136.A084137
Binomial transform of A084136.
- a(n) is the number of times n is in sequence A060715, i.e., there are exactly a(n) cases where there are exactly n primes between m and 2m, exclusively, for m > 0.A084138
a(n) is the number of times n is in sequence A060715, i.e., there are exactly a(n) cases where there are exactly n primes between m and 2m, exclusively, for m > 0.
- a(n) is the largest number for which exactly n primes are bounded between a(n) and 2a(n) exclusively.A084139
a(n) is the largest number for which exactly n primes are bounded between a(n) and 2a(n) exclusively.
- a(n) is the smallest number j such that if x >= j there are at least n primes between x and 2x exclusively.A084140
a(n) is the smallest number j such that if x >= j there are at least n primes between x and 2x exclusively.
- a(n) is the index in sequence A084138 when the value of that sequence is one (1), i.e., there is exactly one case where there are exactly a(n) primes between m and 2m, exclusively, for m > 0.A084141
a(n) is the index in sequence A084138 when the value of that sequence is one (1), i.e., there is exactly one case where there are exactly a(n) primes between m and 2m, exclusively, for m > 0.
- Positive numbers k such that the number of primes between k and 2*k is different from the number of primes between m and 2*m for every number m != k.A084142
Positive numbers k such that the number of primes between k and 2*k is different from the number of primes between m and 2*m for every number m != k.
- Number of partitions of n into a sum of two or more consecutive primes.A084143
Number of partitions of n into a sum of two or more consecutive primes.
- First digit occurring consecutively exactly n times in Pi's decimal expansion.A084144
First digit occurring consecutively exactly n times in Pi's decimal expansion.
- First digit occurring consecutively at least n times in Pi's decimal expansion.A084145
First digit occurring consecutively at least n times in Pi's decimal expansion.
- Integers that have exactly one representation as a sum of two or more consecutive primes.A084146
Integers that have exactly one representation as a sum of two or more consecutive primes.
- Integers that have exactly 2 representations as sums of consecutive primes.A084147
Integers that have exactly 2 representations as sums of consecutive primes.
- Numerators of terms in the Pippenger product.A084148
Numerators of terms in the Pippenger product.
- Denominators of terms in the Pippenger product.A084149
Denominators of terms in the Pippenger product.
- A Pell related sequence.A084150
A Pell related sequence.
- Binomial transform of a Pell convolution.A084151
Binomial transform of a Pell convolution.
- Exponential self-convolution of Jacobsthal numbers (divided by 2).A084152
Exponential self-convolution of Jacobsthal numbers (divided by 2).
- Binomial transform of a Jacobsthal convolution.A084153
Binomial transform of a Jacobsthal convolution.
- Binomial transform of sinh(x)*cosh(sqrt(2)*x).A084154
Binomial transform of sinh(x)*cosh(sqrt(2)*x).
- A Pell-related fourth-order recurrence.A084155
A Pell-related fourth-order recurrence.
- Binomial transform of sinh(x)*cosh(sqrt(3)*x).A084156
Binomial transform of sinh(x)*cosh(sqrt(3)*x).
- a(n) = 8*a(n-1) - 16*a(n-2) + 12*a(n-4) with a(0)=0, a(1)=1, a(2)=4, a(3)=22.A084157
a(n) = 8*a(n-1) - 16*a(n-2) + 12*a(n-4) with a(0)=0, a(1)=1, a(2)=4, a(3)=22.
- a(n) = A000129(n) * A000129(n+1)/2.A084158
a(n) = A000129(n) * A000129(n+1)/2.
- Pell oblongs.A084159
Pell oblongs.
- First occurrence prime gaps of the primes in sequence A002313 (Real primes with corresponding complex primes). a(0) = 2 with length of gap 3. For n>0 the size of the gap in the sequence is 4n, a(n) is the starting prime of the gap.A084160
First occurrence prime gaps of the primes in sequence A002313 (Real primes with corresponding complex primes). a(0) = 2 with length of gap 3. For n>0 the size of the gap in the sequence is 4n, a(n) is the starting prime of the gap.