Sequences
392,541 sequences
- a(n) = A077110(n) - n^2.A077111
a(n) = A077110(n) - n^2.
- a(n)=n^2 times nearest cube to n^2.A077112
a(n)=n^2 times nearest cube to n^2.
- Number of nonnegative integer cubes <= n^2.A077113
Number of nonnegative integer cubes <= n^2.
- Least k such that Z(k,5) <= Z(n,6) where Z(m,s) = Sum_{i>=m} 1/i^s.A077114
Least k such that Z(k,5) <= Z(n,6) where Z(m,s) = Sum_{i>=m} 1/i^s.
- Least integer square >= n^3.A077115
Least integer square >= n^3.
- n^3 - A065733(n).A077116
n^3 - A065733(n).
- Least k such that Z(k,6) <= Z(n,7) where Z(m,s) = Sum_{i>=m} 1/i^s.A077117
Least k such that Z(k,6) <= Z(n,7) where Z(m,s) = Sum_{i>=m} 1/i^s.
- Nearest integer square to n^3.A077118
Nearest integer square to n^3.
- a(n) = A077118(n) - n^3.A077119
a(n) = A077118(n) - n^3.
- n^3 times nearest integer square to n^3.A077120
n^3 times nearest integer square to n^3.
- Number of integer squares <= n^3.A077121
Number of integer squares <= n^3.
- Let M_n be the n X n matrix M_(i,j) = 2^i-2^j then the characteristic polynomial of M_n = x^n-a(n)*x^(n-2).A077122
Let M_n be the n X n matrix M_(i,j) = 2^i-2^j then the characteristic polynomial of M_n = x^n-a(n)*x^(n-2).
- Let M_n be the n X n matrix M_(i,j) = i!-j! then the characteristic polynomial of M_n = x^n+a(n)*x^(n-2).A077123
Let M_n be the n X n matrix M_(i,j) = i!-j! then the characteristic polynomial of M_n = x^n+a(n)*x^(n-2).
- Decimal expansion of the constant c such that A003096(n-1) = ceiling(c^(2^n)).A077124
Decimal expansion of the constant c such that A003096(n-1) = ceiling(c^(2^n)).
- Decimal expansion of the constant c such that A007018(n)=floor(c^(2^n)).A077125
Decimal expansion of the constant c such that A007018(n)=floor(c^(2^n)).
- Sum of even-indexed primes.A077126
Sum of even-indexed primes.
- a(0) = 1, a(1) = 2, a(n) = smallest number other than n, non-coprime to n and not occurring earlier.A077127
a(0) = 1, a(1) = 2, a(n) = smallest number other than n, non-coprime to n and not occurring earlier.
- Smallest number greater than the previous term which is relatively prime to each of the group of the next n numbers.A077128
Smallest number greater than the previous term which is relatively prime to each of the group of the next n numbers.
- Smallest number which is relatively prime to all the numbers between successive odd primes.A077129
Smallest number which is relatively prime to all the numbers between successive odd primes.
- Smallest number which is relatively prime to all the numbers between n^2 and (n+1)^2, inclusive.A077130
Smallest number which is relatively prime to all the numbers between n^2 and (n+1)^2, inclusive.
- Sum of odd-indexed primes.A077131
Sum of odd-indexed primes.
- Duplicate of A075580.A077132
Duplicate of A075580.
- a(n) is the difference between the sum of the first n even-indexed primes and the sum of the first n odd-indexed primes.A077133
a(n) is the difference between the sum of the first n even-indexed primes and the sum of the first n odd-indexed primes.
- Duplicate of A001710.A077134
Duplicate of A001710.
- Composite numbers n whose proper (other than 1 and n) odd divisors are prime and even divisors are 1 less than a prime.A077135
Composite numbers n whose proper (other than 1 and n) odd divisors are prime and even divisors are 1 less than a prime.
- Composite numbers n whose proper divisors (excluding 1 and n) are all of the form p or p+1, with p prime.A077136
Composite numbers n whose proper divisors (excluding 1 and n) are all of the form p or p+1, with p prime.
- Duplicate of A023194.A077137
Duplicate of A023194.
- a(0) = 0. If n is odd, a(n) = a(n-1) + n, otherwise a(n) = a(n-1) * n.A077138
a(0) = 0. If n is odd, a(n) = a(n-1) + n, otherwise a(n) = a(n-1) * n.
- a(1) = 1, a(n) = lcm(n, a(n-1)) / gcd(n, a(n-1)).A077139
a(1) = 1, a(n) = lcm(n, a(n-1)) / gcd(n, a(n-1)).
- a(1) = 1 and then add n to the previous term if n is coprime to the previous term, otherwise subtract n from the previous term. a(1) = 1 and a(n) = a(n-1) + n if gcd(n, a(n-1)) = 1, otherwise a(n) = a(n-1) - n.A077140
a(1) = 1 and then add n to the previous term if n is coprime to the previous term, otherwise subtract n from the previous term. a(1) = 1 and a(n) = a(n-1) + n if gcd(n, a(n-1)) = 1, otherwise a(n) = a(n-1) - n.
- Decimal expansion of the constant c such that A000289(n) = ceiling(c^(2^n)) + 1.A077141
Decimal expansion of the constant c such that A000289(n) = ceiling(c^(2^n)) + 1.
- Decimal expansion of b = log(2*Pi) - 1 - gamma/2.A077142
Decimal expansion of b = log(2*Pi) - 1 - gamma/2.
- a(n) = floor(product of next n primes / sum of next n primes).A077143
a(n) = floor(product of next n primes / sum of next n primes).
- a(n) = floor(product of next n composite numbers / sum of next n composite numbers).A077144
a(n) = floor(product of next n composite numbers / sum of next n composite numbers).
- a(n) = floor(product of next n primes / product of next n composite numbers).A077145
a(n) = floor(product of next n primes / product of next n composite numbers).
- a(n) = floor((concatenation of next (n+1) numbers) / (concatenation of next n numbers)).A077146
a(n) = floor((concatenation of next (n+1) numbers) / (concatenation of next n numbers)).
- a(n) = floor({concatenation 123 ... up to n}/n).A077147
a(n) = floor({concatenation 123 ... up to n}/n).
- Smallest k such that there are n numbers m relatively prime to n in range n < m < k.A077148
Smallest k such that there are n numbers m relatively prime to n in range n < m < k.
- a(1) =3. For n>1, a(n) = smallest k such that there are n numbers m not relatively prime to n in range n < m < k.A077149
a(1) =3. For n>1, a(n) = smallest k such that there are n numbers m not relatively prime to n in range n < m < k.
- Number of composite numbers between n and 2n that are coprime to n.A077150
Number of composite numbers between n and 2n that are coprime to n.
- Index of the first occurrence of n in A077150, or 0 if n does not occur.A077151
Index of the first occurrence of n in A077150, or 0 if n does not occur.
- Smallest k such that there are n primes between n and k.A077152
Smallest k such that there are n primes between n and k.
- Smallest k such that there are n composite numbers greater than n and smaller than k.A077153
Smallest k such that there are n composite numbers greater than n and smaller than k.
- Smallest k such that there are as many composite numbers less than n as there are between n and k.A077154
Smallest k such that there are as many composite numbers less than n as there are between n and k.
- Let p(2n+1,x)=(x+1)(x+2)...(x+2n)(x+2n+1), a(n) is the smallest integer >0 such that p(2n+1,x)-k has only one real root for any k >=a(n).A077155
Let p(2n+1,x)=(x+1)(x+2)...(x+2n)(x+2n+1), a(n) is the smallest integer >0 such that p(2n+1,x)-k has only one real root for any k >=a(n).
- a(0) = 1, followed by next n primes followed by next n composite numbers.A077156
a(0) = 1, followed by next n primes followed by next n composite numbers.
- a(0) = 1, followed by next n composite numbers followed by next n primes.A077157
a(0) = 1, followed by next n composite numbers followed by next n primes.
- Prime(1) composite numbers, followed by composite(1) prime numbers, prime(2) composite numbers, followed by composite(2) prime numbers, ...A077158
Prime(1) composite numbers, followed by composite(1) prime numbers, prime(2) composite numbers, followed by composite(2) prime numbers, ...
- Triangle in which n-th row contains smallest n numbers coprime to n which have not occurred earlier, with a(1)=2.A077159
Triangle in which n-th row contains smallest n numbers coprime to n which have not occurred earlier, with a(1)=2.
- Leading terms of rows of triangle in A077159.A077160
Leading terms of rows of triangle in A077159.