Sequences
392,541 sequences
- Characteristic function of A080113.A080111
Characteristic function of A080113.
- Positions of A080114 in A000040.A080112
Positions of A080114 in A000040.
- Positions of A080115 in A000040.A080113
Positions of A080115 in A000040.
- Odd primes p for which all sums Sum_{j=1..u} L(j/p) (with u ranging from 1 to (p-1)/2) are nonnegative, where L(j/p) is Legendre symbol of j and p.A080114
Odd primes p for which all sums Sum_{j=1..u} L(j/p) (with u ranging from 1 to (p-1)/2) are nonnegative, where L(j/p) is Legendre symbol of j and p.
- Primes not in A080114.A080115
Primes not in A080114.
- Characteristic function of A014486. a(n) = 1 if n's binary expansion is totally balanced, otherwise zero.A080116
Characteristic function of A014486. a(n) = 1 if n's binary expansion is totally balanced, otherwise zero.
- Binary encoding of quadratic residue set formed for n-th prime, coerced to "complementarily symmetric binary sequence" with A080261 if the prime is of the form 4k+1.A080117
Binary encoding of quadratic residue set formed for n-th prime, coerced to "complementarily symmetric binary sequence" with A080261 if the prime is of the form 4k+1.
- Intersection of A080117 and A014486.A080118
Intersection of A080117 and A014486.
- Positions of A080118 in A014486.A080119
Positions of A080118 in A014486.
- Dyck path encodings of Legendre's candelabras formed for primes in A080114. (I.e., symmetric rooted plane trees constructed from their quadratic residue sets.)A080120
Dyck path encodings of Legendre's candelabras formed for primes in A080114. (I.e., symmetric rooted plane trees constructed from their quadratic residue sets.)
- a(n) is the smallest k > 0 such that n^2^k + (n+1)^2^k is prime, or -1 if no such k exists.A080121
a(n) is the smallest k > 0 such that n^2^k + (n+1)^2^k is prime, or -1 if no such k exists.
- Number of primes less than n*10^13.A080122
Number of primes less than n*10^13.
- Number of primes less than n*10^14.A080123
Number of primes less than n*10^14.
- Number of primes less than n*10^15.A080124
Number of primes less than n*10^15.
- Number of primes less than n*10^16.A080125
Number of primes less than n*10^16.
- Number of primes less than n*10^17.A080126
Number of primes less than n*10^17.
- Number of primes less than n*10^18.A080127
Number of primes less than n*10^18.
- Number of primes less than n*10^19.A080128
Number of primes less than n*10^19.
- Number of primes less than n*10^20.A080129
Number of primes less than n*10^20.
- Decimal expansion of exp(-gamma).A080130
Decimal expansion of exp(-gamma).
- Conjectured number of generalized Fermat primes of the form (n+1)^2^k + n^2^k, with k>1.A080131
Conjectured number of generalized Fermat primes of the form (n+1)^2^k + n^2^k, with k>1.
- Number of primes between n*10^13 and (n+1)*10^13.A080132
Number of primes between n*10^13 and (n+1)*10^13.
- Conjectured number of generalized Fermat primes of the form (n+1)^2^k + n^2^k, with k>0.A080133
Conjectured number of generalized Fermat primes of the form (n+1)^2^k + n^2^k, with k>0.
- Conjectured number of generalized Fermat primes of the form (n+1)^2^k + n^2^k, with k>=0.A080134
Conjectured number of generalized Fermat primes of the form (n+1)^2^k + n^2^k, with k>=0.
- a(n+1) = floor(a(n) * Sum_{k=0..n} 1/a(k)^s), where s = Sum_{k>=0} 1/a(k)^s and a(0)=1; s = 2.260568736857767...A080135
a(n+1) = floor(a(n) * Sum_{k=0..n} 1/a(k)^s), where s = Sum_{k>=0} 1/a(k)^s and a(0)=1; s = 2.260568736857767...
- Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1 and x=1.A080136
Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1 and x=1.
- Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1 and x=2.A080137
Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1 and x=2.
- Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1 and x=3.A080138
Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1 and x=3.
- Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1, a(n+1)>a(n) and x=3-Pi/2.A080139
Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1, a(n+1)>a(n) and x=3-Pi/2.
- Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1 and x=2/3.A080140
Least positive integer multiples of angle x such that their direction cosines form a unit vector: Sum_{k>0} cos(a(k)*x)^2 = 1, where a(1)=1 and x=2/3.
- a(n) = (3^(n-1))*(n!)^2.A080141
a(n) = (3^(n-1))*(n!)^2.
- Greedy frac multiples of 1/Pi: a(1)=1, Sum_{n>0} frac(a(n)*x) = 1 at x=1/Pi, where "frac(y)" denotes the fractional part of y.A080142
Greedy frac multiples of 1/Pi: a(1)=1, Sum_{n>0} frac(a(n)*x) = 1 at x=1/Pi, where "frac(y)" denotes the fractional part of y.
- a(n) = F(3)*F(n)*F(n+1) + F(4)*F(n+1)^2 - F(4) if n even, F(3)*F(n)*F(n+1) + F(4)*F(n+1)^2 if n odd, where F(n) is the n-th Fibonacci number (A000045).A080143
a(n) = F(3)*F(n)*F(n+1) + F(4)*F(n+1)^2 - F(4) if n even, F(3)*F(n)*F(n+1) + F(4)*F(n+1)^2 if n odd, where F(n) is the n-th Fibonacci number (A000045).
- a(n) = F(4)*F(n)*F(n+1) + F(5)*F(n+1)^2 if n odd, a(n) = F(4)*F(n)*F(n+1) + F(5)*F(n+1)^2 - F(5) if n even, where F(n) is the n-th Fibonacci number (A000045).A080144
a(n) = F(4)*F(n)*F(n+1) + F(5)*F(n+1)^2 if n odd, a(n) = F(4)*F(n)*F(n+1) + F(5)*F(n+1)^2 - F(5) if n even, where F(n) is the n-th Fibonacci number (A000045).
- a(n) = Sum_{m=1..n} Sum_{i=1..m} F(i)*F(i+1) where F(n)=Fibonacci numbers A000045.A080145
a(n) = Sum_{m=1..n} Sum_{i=1..m} F(i)*F(i+1) where F(n)=Fibonacci numbers A000045.
- Binary encoding of quadratic residue set for each prime. a(n) = A055094(A000040(n)).A080146
Binary encoding of quadratic residue set for each prime. a(n) = A055094(A000040(n)).
- Positions of primes of the form 4*k+1 (A002144) among all primes (A000040).A080147
Positions of primes of the form 4*k+1 (A002144) among all primes (A000040).
- Positions of primes of the form 4*k+3 (A002145) among all primes (A000040).A080148
Positions of primes of the form 4*k+3 (A002145) among all primes (A000040).
- Numbers k such that k^2 + 1 and k^2 + 3 are both prime.A080149
Numbers k such that k^2 + 1 and k^2 + 3 are both prime.
- Let m = Wonderful Demlo number A002477(n); a(n) = square of the sum of digits of m.A080150
Let m = Wonderful Demlo number A002477(n); a(n) = square of the sum of digits of m.
- Let m = Wonderful Demlo number A002477(n); a(n) = sum of digits of m.A080151
Let m = Wonderful Demlo number A002477(n); a(n) = sum of digits of m.
- Values of n corresponding to the primes given in A073640. The concatenation of the a(n) and a(n+1)-th primes for any n is also prime.A080152
Values of n corresponding to the primes given in A073640. The concatenation of the a(n) and a(n+1)-th primes for any n is also prime.
- a(1)=2, a(2)=3; a(n) for n>2 is the first prime > a(n-1) such that the concatenation of a(n-1), a(n-2) and a(n) is also prime.A080153
a(1)=2, a(2)=3; a(n) for n>2 is the first prime > a(n-1) such that the concatenation of a(n-1), a(n-2) and a(n) is also prime.
- Values of n corresponding to the terms in sequence A080153.A080154
Values of n corresponding to the terms in sequence A080153.
- a(1)=2; a(n) for n>1 is the smallest prime number > a(n-1) such that the concatenation of all previous terms is also prime.A080155
a(1)=2; a(n) for n>1 is the smallest prime number > a(n-1) such that the concatenation of all previous terms is also prime.
- Values of n corresponding to the terms in sequence A080155. For any k, the concatenation of the a(1) to a(k)-th primes is prime and each value of k is the smallest for which this is true.A080156
Values of n corresponding to the terms in sequence A080155. For any k, the concatenation of the a(1) to a(k)-th primes is prime and each value of k is the smallest for which this is true.
- Greedy frac multiples of gamma: a(1)=1, Sum_{n>0} frac(a(n)*x) = 1 at x=gamma, where "frac(y)" denotes the fractional part of y.A080157
Greedy frac multiples of gamma: a(1)=1, Sum_{n>0} frac(a(n)*x) = 1 at x=gamma, where "frac(y)" denotes the fractional part of y.
- Greedy frac multiples of Catalan's constant, G: a(1)=1, Sum_{n>0} frac(a(n)*x) = 1 at x=G=A006752, where "frac(y)" denotes the fractional part of y.A080158
Greedy frac multiples of Catalan's constant, G: a(1)=1, Sum_{n>0} frac(a(n)*x) = 1 at x=G=A006752, where "frac(y)" denotes the fractional part of y.
- Triangular array of ways of drawing k non-intersecting chords between n points on a circle; i.e., Motzkin polynomial coefficients.A080159
Triangular array of ways of drawing k non-intersecting chords between n points on a circle; i.e., Motzkin polynomial coefficients.
- Squares that are digit sums of Wonderful Demlo numbers A002477.A080160
Squares that are digit sums of Wonderful Demlo numbers A002477.