Sequences
392,541 sequences
- Nonprime numbers n such that q=phi(n)/(sigma(n)-n-1) is an integer and n is not a prime square.A070161
Nonprime numbers n such that q=phi(n)/(sigma(n)-n-1) is an integer and n is not a prime square.
- Numbers k such that k - phi(k) - 1 is a prime.A070162
Numbers k such that k - phi(k) - 1 is a prime.
- Primes arising in A070162.A070163
Primes arising in A070162.
- Least number m such that cototient(m) - 1 = prime(n).A070164
Least number m such that cototient(m) - 1 = prime(n).
- Irregular triangle read by rows giving trajectory of n in Collatz problem.A070165
Irregular triangle read by rows giving trajectory of n in Collatz problem.
- Irregular triangle read by rows giving T(n,k) = number of rooted graphs on n + 1 nodes with k edges (n >= 0, 0 <= k <= n(n-1)/2).A070166
Irregular triangle read by rows giving T(n,k) = number of rooted graphs on n + 1 nodes with k edges (n >= 0, 0 <= k <= n(n-1)/2).
- a(n) is the smallest starting value that produces a Collatz sequence in which n occurs.A070167
a(n) is the smallest starting value that produces a Collatz sequence in which n occurs.
- Irregular triangle of Terras-modified Collatz problem.A070168
Irregular triangle of Terras-modified Collatz problem.
- Rounded total surface area of a regular tetrahedron with edge length n.A070169
Rounded total surface area of a regular tetrahedron with edge length n.
- Numbers k such that sigma(k-phi(k)) = phi(k).A070170
Numbers k such that sigma(k-phi(k)) = phi(k).
- Numbers k such that sigma(phi(k)) = k-phi(k).A070171
Numbers k such that sigma(phi(k)) = k-phi(k).
- Smallest k such that sigma(k) >= n.A070172
Smallest k such that sigma(k) >= n.
- Numbers k such that k! and 2^k+1 are relatively prime.A070173
Numbers k such that k! and 2^k+1 are relatively prime.
- Primes p such that (p^2)! and 2^(p^2)-1 are not relatively prime.A070174
Primes p such that (p^2)! and 2^(p^2)-1 are not relatively prime.
- The smallest representative of each (bigomega(n),omega(n)) pair.A070175
The smallest representative of each (bigomega(n),omega(n)) pair.
- Let s(n) be smallest number >= n which is a sum of two squares (A001481); sequence gives s(n) - n.A070176
Let s(n) be smallest number >= n which is a sum of two squares (A001481); sequence gives s(n) - n.
- Number of partitions of 10^n.A070177
Number of partitions of 10^n.
- Coefficients of Lehmer's polynomial.A070178
Coefficients of Lehmer's polynomial.
- Primes p such that x^2 = 2 has a solution mod p, but x^(2^2) = 2 has no solution mod p.A070179
Primes p such that x^2 = 2 has a solution mod p, but x^(2^2) = 2 has no solution mod p.
- Primes p such that x^3 = 2 has a solution mod p, but x^(3^2) = 2 has no solution mod p.A070180
Primes p such that x^3 = 2 has a solution mod p, but x^(3^2) = 2 has no solution mod p.
- Primes p such that x^4 = 2 has a solution mod p, but x^(4^2) = 2 has no solution mod p.A070181
Primes p such that x^4 = 2 has a solution mod p, but x^(4^2) = 2 has no solution mod p.
- Primes p such that x^5 = 2 has a solution mod p, but x^(5^2) = 2 has no solution mod p.A070182
Primes p such that x^5 = 2 has a solution mod p, but x^(5^2) = 2 has no solution mod p.
- Primes p such that x^6 = 2 has a solution mod p, but x^(6^2) = 2 has no solution mod p.A070183
Primes p such that x^6 = 2 has a solution mod p, but x^(6^2) = 2 has no solution mod p.
- Primes p such that x^8 = 2 has a solution mod p, but x^(8^2) = 2 has no solution mod p.A070184
Primes p such that x^8 = 2 has a solution mod p, but x^(8^2) = 2 has no solution mod p.
- Primes p such that x^9 = 2 has a solution mod p, but x^(9^2) = 2 has no solution mod p.A070185
Primes p such that x^9 = 2 has a solution mod p, but x^(9^2) = 2 has no solution mod p.
- Primes p such that x^10 = 2 has a solution mod p, but x^(10^2) = 2 has no solution mod p.A070186
Primes p such that x^10 = 2 has a solution mod p, but x^(10^2) = 2 has no solution mod p.
- Primes p such that x^11 = 2 has a solution mod p, but x^(11^2) = 2 has no solution mod p.A070187
Primes p such that x^11 = 2 has a solution mod p, but x^(11^2) = 2 has no solution mod p.
- Primes p such that x^12 = 2 has a solution mod p, but x^(12^2) = 2 has no solution mod p.A070188
Primes p such that x^12 = 2 has a solution mod p, but x^(12^2) = 2 has no solution mod p.
- a(n) = 12345679*n.A070189
a(n) = 12345679*n.
- Expansion of e.g.f. I_0(2*x)^5 + 2*Sum_{k>=1} I_k(2*x)^5, where I_n(z) are modified Bessel functions of order n.A070190
Expansion of e.g.f. I_0(2*x)^5 + 2*Sum_{k>=1} I_k(2*x)^5, where I_n(z) are modified Bessel functions of order n.
- Numbers k such that gcd(3*k, 8^k+1) = 3.A070191
Numbers k such that gcd(3*k, 8^k+1) = 3.
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.A070192
Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.
- Numbers k such that gcd(3k,8^k+1) = 3 but k does not divide the numerator of B(2k) (the Bernoulli numbers).A070193
Numbers k such that gcd(3k,8^k+1) = 3 but k does not divide the numerator of B(2k) (the Bernoulli numbers).
- List the phi(n) numbers from 1 to n-1 which are relatively prime to n; sequence gives size of maximal gap.A070194
List the phi(n) numbers from 1 to n-1 which are relatively prime to n; sequence gives size of maximal gap.
- Squarefree numbers sandwiched between a pair of twin primes.A070195
Squarefree numbers sandwiched between a pair of twin primes.
- a(n) = n plus the sorted version of the base-10 digits of n.A070196
a(n) = n plus the sorted version of the base-10 digits of n.
- Base-60 (or sexagesimal or Babylonian) expansion of sqrt(2).A070197
Base-60 (or sexagesimal or Babylonian) expansion of sqrt(2).
- Smallest nonnegative number m such that m == i (mod i+1) for all 1 <= i <= n.A070198
Smallest nonnegative number m such that m == i (mod i+1) for all 1 <= i <= n.
- Number of palindromes of length <= n.A070199
Number of palindromes of length <= n.
- Inradii of integer triangles [A070080(n), A070081(n), A070082(n)], rounded values.A070200
Inradii of integer triangles [A070080(n), A070081(n), A070082(n)], rounded values.
- Number of integer triangles with perimeter n having integral inradius.A070201
Number of integer triangles with perimeter n having integral inradius.
- Number of integer triangles with perimeter n, integer inradius and side lengths that are not relatively prime.A070202
Number of integer triangles with perimeter n, integer inradius and side lengths that are not relatively prime.
- Number of scalene integer triangles with perimeter n having integral inradius.A070203
Number of scalene integer triangles with perimeter n having integral inradius.
- Number of isosceles integer triangles with perimeter n having integral inradius.A070204
Number of isosceles integer triangles with perimeter n having integral inradius.
- Number of acute integer triangles with perimeter n having integral inradius.A070205
Number of acute integer triangles with perimeter n having integral inradius.
- Number of obtuse integer triangles with perimeter n having integral inradius.A070206
Number of obtuse integer triangles with perimeter n having integral inradius.
- Expansion of (1-x-5*x^2)/(1-3*x-2*x^2-x^3).A070207
Expansion of (1-x-5*x^2)/(1-3*x-2*x^2-x^3).
- Number of integer triangles with perimeter n having integral area but not integral inradius.A070208
Number of integer triangles with perimeter n having integral area but not integral inradius.
- Numbers n such that [A070080(n), A070081(n), A070082(n)] is an integer triangle with integer inradius.A070209
Numbers n such that [A070080(n), A070081(n), A070082(n)] is an integer triangle with integer inradius.
- Inradii of integer triangles [A070080(A070209(n)), A070081(A070209(n)), A070082(A070209(n))].A070210
Inradii of integer triangles [A070080(A070209(n)), A070081(A070209(n)), A070082(A070209(n))].