Sequences
392,541 sequences
- a(n) = a(floor(sqrt(n))) * 2.A063511
a(n) = a(floor(sqrt(n))) * 2.
- Least number starting a chain of exactly 2n-1 consecutive integers that do not have totient inverses.A063512
Least number starting a chain of exactly 2n-1 consecutive integers that do not have totient inverses.
- Least balanced numbers (A020492): m such that the quotient sigma(m)/phi(m) equals the n-th prime.A063513
Least balanced numbers (A020492): m such that the quotient sigma(m)/phi(m) equals the n-th prime.
- a(n) = sigma(n) mod phi(n).A063514
a(n) = sigma(n) mod phi(n).
- Sum of divisors of Woodall (or Riesel) numbers; sigma(A003261(n)); sigma(n*2^n - 1).A063515
Sum of divisors of Woodall (or Riesel) numbers; sigma(A003261(n)); sigma(n*2^n - 1).
- Multiples of single electron masses yielding stable particles intermediate between an electron and a proton as given in reference below.A063516
Multiples of single electron masses yielding stable particles intermediate between an electron and a proton as given in reference below.
- Theta series of 48-dimensional even unimodular lattice midway between A_48 and A^*_48.A063517
Theta series of 48-dimensional even unimodular lattice midway between A_48 and A^*_48.
- Values of 17^n mod 23.A063518
Values of 17^n mod 23.
- Least composite k such that phi(k+12n) = phi(k)+12n and sigma(k+12n) = sigma(k) + 12n where phi is the Euler totient function and sigma is the sum of divisors function.A063519
Least composite k such that phi(k+12n) = phi(k)+12n and sigma(k+12n) = sigma(k) + 12n where phi is the Euler totient function and sigma is the sum of divisors function.
- Sum divides product: number of solutions (r,s,t), r>=s>=t>0, to the equation rst = n(r+s+t).A063520
Sum divides product: number of solutions (r,s,t), r>=s>=t>0, to the equation rst = n(r+s+t).
- a(n) = n*(7*n^2-4)/3.A063521
a(n) = n*(7*n^2-4)/3.
- a(n) = n*(5*n^2 - 3)/2.A063522
a(n) = n*(5*n^2 - 3)/2.
- a(n) = n*(8*n^2 - 5)/3.A063523
a(n) = n*(8*n^2 - 5)/3.
- Characteristic function of 1.A063524
Characteristic function of 1.
- Sum divides product: number of ordered triples of positive solutions (r,s,t) to the equation rst = n(r+s+t).A063525
Sum divides product: number of ordered triples of positive solutions (r,s,t) to the equation rst = n(r+s+t).
- Smallest k such that 2^k has exactly n 5's in its decimal representation.A063526
Smallest k such that 2^k has exactly n 5's in its decimal representation.
- Numbers that are divisible by all of their 1 and 2 digit substrings.A063527
Numbers that are divisible by all of their 1 and 2 digit substrings.
- Smallest number such that it and its successor are both divisible by an n-th power larger than 1.A063528
Smallest number such that it and its successor are both divisible by an n-th power larger than 1.
- a(n) = M(2^n-1), where M() is A029834, a discrete version of the Mangoldt function: if n is prime then floor(log(n)) else 0 and 2^n-1 is A000225.A063529
a(n) = M(2^n-1), where M() is A029834, a discrete version of the Mangoldt function: if n is prime then floor(log(n)) else 0 and 2^n-1 is A000225.
- Numbers k such that phi(k)+1 is a square.A063530
Numbers k such that phi(k)+1 is a square.
- Numbers k such that sigma(k) + 1 is a square.A063531
Numbers k such that sigma(k) + 1 is a square.
- Numbers k such that phi(k) + 1 = x^2 and sigma(k) + 1 = y^2 for some x and y.A063532
Numbers k such that phi(k) + 1 = x^2 and sigma(k) + 1 = y^2 for some x and y.
- Hypotenuses of special Pythagorean triples constructed from twin primes as follows: {u, w}={p,p+2}; side a=2p(p+2), side b=(p+2)^2-p^2 and the terms of sequence are values of c=a(n)=p^2+(p+2)^2=phi(a/2)+1+sigma(a/2)+1.A063533
Hypotenuses of special Pythagorean triples constructed from twin primes as follows: {u, w}={p,p+2}; side a=2p(p+2), side b=(p+2)^2-p^2 and the terms of sequence are values of c=a(n)=p^2+(p+2)^2=phi(a/2)+1+sigma(a/2)+1.
- Numbers k such that C(k) = H(k) + d(k), where C(k) is Chowla's function A048050, H(k) is the half-totient function A023022 and d(k) is the number of divisors function A000005.A063534
Numbers k such that C(k) = H(k) + d(k), where C(k) is Chowla's function A048050, H(k) is the half-totient function A023022 and d(k) is the number of divisors function A000005.
- Primes prime(n) such that prime(n+1)^2 < prime(n)*prime(n+2).A063535
Primes prime(n) such that prime(n+1)^2 < prime(n)*prime(n+2).
- a(n) = floor(cotangent(n)^3).A063536
a(n) = floor(cotangent(n)^3).
- Numbers k such that floor(tan(k)) > floor(tan(m)) for all m < k.A063537
Numbers k such that floor(tan(k)) > floor(tan(m)) for all m < k.
- Numbers n that are not sqrt(n-1)-smooth: largest prime factor of n (=A006530(n)) >= sqrt(n).A063538
Numbers n that are not sqrt(n-1)-smooth: largest prime factor of n (=A006530(n)) >= sqrt(n).
- Numbers n that are sqrt(n-1)-smooth: largest prime factor of n (=A006530(n)) < sqrt(n).A063539
Numbers n that are sqrt(n-1)-smooth: largest prime factor of n (=A006530(n)) < sqrt(n).
- Smallest k such that 2^k has exactly n 6's in its decimal representation.A063540
Smallest k such that 2^k has exactly n 6's in its decimal representation.
- Least number of empty triangles determined by n points in the plane.A063541
Least number of empty triangles determined by n points in the plane.
- Least number of empty convex quadrilaterals (4-gons) determined by n points in the plane.A063542
Least number of empty convex quadrilaterals (4-gons) determined by n points in the plane.
- a(n) = n - product of the nonzero digits of n.A063543
a(n) = n - product of the nonzero digits of n.
- Smallest number of triangulations of n points in the plane.A063544
Smallest number of triangulations of n points in the plane.
- Largest number of triangulations of n points in the plane.A063545
Largest number of triangulations of n points in the plane.
- Largest number of crossing-free Hamiltonian cycles of n points in the plane.A063546
Largest number of crossing-free Hamiltonian cycles of n points in the plane.
- Integers with consecutive anti-divisors.A063547
Integers with consecutive anti-divisors.
- Largest number of straight line crossing-free spanning trees on n points in the plane.A063548
Largest number of straight line crossing-free spanning trees on n points in the plane.
- Smallest number of crossing-free matchings on n points in the plane.A063549
Smallest number of crossing-free matchings on n points in the plane.
- Largest number of crossing-free matchings on a set S of n points in the plane, that is, a set of floor(n/2) pairwise non-intersecting segments with endpoints in S having no endpoint in common.A063550
Largest number of crossing-free matchings on a set S of n points in the plane, that is, a set of floor(n/2) pairwise non-intersecting segments with endpoints in S having no endpoint in common.
- Maximal number of pairs of elements of an n-set S in the plane that can be separated from S by a straight line.A063551
Maximal number of pairs of elements of an n-set S in the plane that can be separated from S by a straight line.
- Smallest k such that 2^k has exactly n 7's in its decimal representation.A063552
Smallest k such that 2^k has exactly n 7's in its decimal representation.
- Smallest k such that 2^k has exactly n 8's in its decimal representation.A063553
Smallest k such that 2^k has exactly n 8's in its decimal representation.
- Smallest k such that 2^k has exactly n 9's in its decimal representation.A063554
Smallest k such that 2^k has exactly n 9's in its decimal representation.
- Smallest k such that 3^k has exactly n 0's in its decimal representation.A063555
Smallest k such that 3^k has exactly n 0's in its decimal representation.
- Smallest k such that 3^k has exactly n 1's in its decimal representation.A063556
Smallest k such that 3^k has exactly n 1's in its decimal representation.
- Smallest k such that 3^k has exactly n 2's in its decimal representation.A063557
Smallest k such that 3^k has exactly n 2's in its decimal representation.
- Smallest k such that 3^k has exactly n 3's in its decimal representation.A063558
Smallest k such that 3^k has exactly n 3's in its decimal representation.
- Smallest k such that 3^k has exactly n 4's in its decimal representation.A063559
Smallest k such that 3^k has exactly n 4's in its decimal representation.
- Smallest k such that 3^k has exactly n 5's in its decimal representation.A063560
Smallest k such that 3^k has exactly n 5's in its decimal representation.