Sequences
392,541 sequences
- a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) properly contained in the digits of a(n+1), with a(0)=1.A067711
a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) properly contained in the digits of a(n+1), with a(0)=1.
- Numbers n such that sum of exponents in prime factorization of n is > log(n).A067712
Numbers n such that sum of exponents in prime factorization of n is > log(n).
- a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(0)=1.A067713
a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(0)=1.
- a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) properly contained in the digits of a(n+1), with a(0)=4.A067714
a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) properly contained in the digits of a(n+1), with a(0)=4.
- Numbers k such that the sum of exponents in the prime factorization of k is < log(k).A067715
Numbers k such that the sum of exponents in the prime factorization of k is < log(k).
- The least number k whose standard deviation of its prime factors (rounded up if necessary), with each factor counted according to its frequency of occurrence in the prime factorization of k (A067631) is n.A067716
The least number k whose standard deviation of its prime factors (rounded up if necessary), with each factor counted according to its frequency of occurrence in the prime factorization of k (A067631) is n.
- a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(0)=4.A067717
a(n+1) is the smallest square > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(0)=4.
- Numbers k such that sigma(2^k+1) == 0 (mod k).A067718
Numbers k such that sigma(2^k+1) == 0 (mod k).
- Numbers k such that sigma(k^2 + 1) == 0 (mod k).A067719
Numbers k such that sigma(k^2 + 1) == 0 (mod k).
- Numbers k such that phi(k^2+1) = k*phi(k+1).A067720
Numbers k such that phi(k^2+1) = k*phi(k+1).
- Least number k such that k (k + n) is a perfect square, or 0 if impossible.A067721
Least number k such that k (k + n) is a perfect square, or 0 if impossible.
- Least positive integer k such that n*(n + k) is a perfect square.A067722
Least positive integer k such that n*(n + k) is a perfect square.
- Nontrivial palindromes k such that phi(k) is also a palindrome.A067723
Nontrivial palindromes k such that phi(k) is also a palindrome.
- a(n) = 5*n^2 + 10*n.A067724
a(n) = 5*n^2 + 10*n.
- a(n) = 3*n^2 + 6*n.A067725
a(n) = 3*n^2 + 6*n.
- a(n) = 6*n^2 + 12*n.A067726
a(n) = 6*n^2 + 12*n.
- a(n) = 7*n^2 + 14*n.A067727
a(n) = 7*n^2 + 14*n.
- a(n) = 2*n^2 + 8*n.A067728
a(n) = 2*n^2 + 8*n.
- Numbers k such that floor(log(3)^k) is prime.A067729
Numbers k such that floor(log(3)^k) is prime.
- Numbers n such that sigma(n-1) + sigma(n+1) = sigma(2n).A067730
Numbers n such that sigma(n-1) + sigma(n+1) = sigma(2n).
- Maximum number of distinct parts in a self-conjugate partition of n, or 0 if n=2.A067731
Maximum number of distinct parts in a self-conjugate partition of n, or 0 if n=2.
- Numbers k such that phi(prime(k) + 1) == 0 (mod k).A067732
Numbers k such that phi(prime(k) + 1) == 0 (mod k).
- Numbers k such that phi(prime(k)-1) == 0 (mod k).A067733
Numbers k such that phi(prime(k)-1) == 0 (mod k).
- Number of ways writing n as a product of decimal digits of some other number which has no digits equal to 1.A067734
Number of ways writing n as a product of decimal digits of some other number which has no digits equal to 1.
- Number of partitions of 2^n into distinct parts.A067735
Number of partitions of 2^n into distinct parts.
- Decimal expansion of exp(3/2).A067736
Decimal expansion of exp(3/2).
- Integers n such that [number of integers k such that k is not of the form m + reverse(m) for any m and n occurs in the "Reverse and Add!" trajectory of k] is greater than [number of integers k such that n = k + reverse(k)].A067737
Integers n such that [number of integers k such that k is not of the form m + reverse(m) for any m and n occurs in the "Reverse and Add!" trajectory of k] is greater than [number of integers k such that n = k + reverse(k)].
- Numbers k such that sigma(k) + sigma(sigma(k)) is prime.A067738
Numbers k such that sigma(k) + sigma(sigma(k)) is prime.
- Integers x such that for some integer y we have uphi(x) = uphi(y) = x-y, where uphi(n) = A047994(n) is the unitary totient function: If n = Product p_i^e_i, uphi(n) = Product (p_i^e_i - 1).A067739
Integers x such that for some integer y we have uphi(x) = uphi(y) = x-y, where uphi(n) = A047994(n) is the unitary totient function: If n = Product p_i^e_i, uphi(n) = Product (p_i^e_i - 1).
- Smallest number k such that sigma(k)/sigma(phi(k)) = n.A067740
Smallest number k such that sigma(k)/sigma(phi(k)) = n.
- Integers y such that for some integer x we have uphi(x) = uphi(y) = x-y, where uphi(n) = A047994(n) is the unitary totient function: If n = Product p_i^e_i, uphi(n) = Product (p_i^e_i - 1).A067741
Integers y such that for some integer x we have uphi(x) = uphi(y) = x-y, where uphi(n) = A047994(n) is the unitary totient function: If n = Product p_i^e_i, uphi(n) = Product (p_i^e_i - 1).
- Number of middle divisors of n, i.e., divisors in the half-open interval [sqrt(n/2), sqrt(n*2)).A067742
Number of middle divisors of n, i.e., divisors in the half-open interval [sqrt(n/2), sqrt(n*2)).
- Number of divisors of n not in the half-open interval [sqrt(n/2), sqrt(n*2)).A067743
Number of divisors of n not in the half-open interval [sqrt(n/2), sqrt(n*2)).
- Number of terms yielding particularly small errors in a numerical integration of exp((cos(x)-1)/(cos(x)+1)) having non-monotonic sub-geometric convergence.A067744
Number of terms yielding particularly small errors in a numerical integration of exp((cos(x)-1)/(cos(x)+1)) having non-monotonic sub-geometric convergence.
- Numerator of ((3*n - 2)/(n^(2*n - 1)*(2*n - 1)*4^(n - 1))).A067745
Numerator of ((3*n - 2)/(n^(2*n - 1)*(2*n - 1)*4^(n - 1))).
- Denominator of ((3 * n - 2)/(n^(2 * n - 1) * (2 * n - 1) * 4^(n - 1))).A067746
Denominator of ((3 * n - 2)/(n^(2 * n - 1) * (2 * n - 1) * 4^(n - 1))).
- Primes interleaved between composite numbers: n-th prime followed by the n-th composite number.A067747
Primes interleaved between composite numbers: n-th prime followed by the n-th composite number.
- Smallest member of the first occurrence of exactly n consecutive primes whose sum of digits is also prime, or 0 if no such set of primes exists.A067748
Smallest member of the first occurrence of exactly n consecutive primes whose sum of digits is also prime, or 0 if no such set of primes exists.
- Numbers k such that k and 3^k end with the same two digits.A067749
Numbers k such that k and 3^k end with the same two digits.
- Numbers k whose last digit is the k-th digit of Pi.A067750
Numbers k whose last digit is the k-th digit of Pi.
- Number of solutions in nonnegative integers of x*y+x*z+y*z = n.A067751
Number of solutions in nonnegative integers of x*y+x*z+y*z = n.
- Number of unordered solutions of xy + xz + yz = n in nonnegative integers.A067752
Number of unordered solutions of xy + xz + yz = n in nonnegative integers.
- Number of primitive solutions in nonnegative integers of x*y+x*z+y*z = n.A067753
Number of primitive solutions in nonnegative integers of x*y+x*z+y*z = n.
- Number of unordered primitive solutions to xy+xz+yz=n.A067754
Number of unordered primitive solutions to xy+xz+yz=n.
- Even legs of Pythagorean triangles whose other leg and hypotenuse are both prime.A067755
Even legs of Pythagorean triangles whose other leg and hypotenuse are both prime.
- Prime hypotenuses of Pythagorean triangles with a prime leg.A067756
Prime hypotenuses of Pythagorean triangles with a prime leg.
- Numbers k whose last digit is the k-th digit of sqrt(2).A067757
Numbers k whose last digit is the k-th digit of sqrt(2).
- Numbers k such that sigma(prime(k) - 1) == 0 (mod k).A067758
Numbers k such that sigma(prime(k) - 1) == 0 (mod k).
- Numbers k such that sigma(prime(k) + 1) == 0 (mod k).A067759
Numbers k such that sigma(prime(k) + 1) == 0 (mod k).
- a(n) is the least positive k such that (2n+1) + 2^k is prime, or 0 if no such k exists.A067760
a(n) is the least positive k such that (2n+1) + 2^k is prime, or 0 if no such k exists.