Sequences
392,541 sequences
- Arrange 1-digit numbers in alphabetical order in Italian, then the 2-digit numbers, then the 3-digit numbers, etc.A063761
Arrange 1-digit numbers in alphabetical order in Italian, then the 2-digit numbers, then the 3-digit numbers, etc.
- Sqrt(n)-rough nonprimes: largest prime factor of n (A006530) >= sqrt(n).A063762
Sqrt(n)-rough nonprimes: largest prime factor of n (A006530) >= sqrt(n).
- Composite integers k such that largest prime factor of k > sqrt(k).A063763
Composite integers k such that largest prime factor of k > sqrt(k).
- Nonprimes k such that largest prime factor of k > k^(2/3).A063764
Nonprimes k such that largest prime factor of k > k^(2/3).
- Least integer m whose largest prime factor > m^(n/(n+1)).A063765
Least integer m whose largest prime factor > m^(n/(n+1)).
- a(n) is the smallest prime >= 6^n.A063766
a(n) is the smallest prime >= 6^n.
- Smallest prime > 7^n.A063767
Smallest prime > 7^n.
- Smallest prime >= 8^n.A063768
Smallest prime >= 8^n.
- Aspiring numbers: numbers whose aliquot sequence terminates in a perfect number.A063769
Aspiring numbers: numbers whose aliquot sequence terminates in a perfect number.
- Numbers k such that Sum_{j=1..k} sigma(j) divides Product_{j=1..k} phi(j).A063770
Numbers k such that Sum_{j=1..k} sigma(j) divides Product_{j=1..k} phi(j).
- Numbers n such that n^sin(n) > m^sin(m) for all m < n and n^sin(n) is rounded to nearest integer.A063771
Numbers n such that n^sin(n) > m^sin(m) for all m < n and n^sin(n) is rounded to nearest integer.
- a(k^2 + i) = k + a(i) for k >= 0 and 0 <= i <= k * 2; a(0) = 0.A063772
a(k^2 + i) = k + a(i) for k >= 0 and 0 <= i <= k * 2; a(0) = 0.
- Smallest number that is centered polygonal in exactly n ways.A063773
Smallest number that is centered polygonal in exactly n ways.
- Numbers k such that the number of divisors of k^2 is a square.A063774
Numbers k such that the number of divisors of k^2 is a square.
- Number of 4th powers dividing n.A063775
Number of 4th powers dividing n.
- Number of subsets of {1,2,...,n} which sum to 0 modulo n.A063776
Number of subsets of {1,2,...,n} which sum to 0 modulo n.
- t(n^2) is a square and sets a new record for such squares, where t(n) = (sigma(n)-n)*omega(n); or t(n)= A001065(n)*A001221(n).A063777
t(n^2) is a square and sets a new record for such squares, where t(n) = (sigma(n)-n)*omega(n); or t(n)= A001065(n)*A001221(n).
- a(n) = the least integer that is polygonal in exactly n ways.A063778
a(n) = the least integer that is polygonal in exactly n ways.
- Duplicate of A063781.A063779
Duplicate of A063781.
- a(n) is the number of pairs of integer quadruples (b_1, b_2, b_3, b_4) and (c_1, c_2, c_3, c_4) satisfying 1 <= b_1 < b_2 < b_3 < b_4 < n, 1 <= c_1 < c_2 < c_3 < c_4 < n, b_i != c_j for all i,j = 1,2,3,4 and Product_{i=1..4} cos(2*Pi*b_i/n) = Product_{i=1..4} cos(2*Pi*c_i/n).A063780
a(n) is the number of pairs of integer quadruples (b_1, b_2, b_3, b_4) and (c_1, c_2, c_3, c_4) satisfying 1 <= b_1 < b_2 < b_3 < b_4 < n, 1 <= c_1 < c_2 < c_3 < c_4 < n, b_i != c_j for all i,j = 1,2,3,4 and Product_{i=1..4} cos(2*Pi*b_i/n) = Product_{i=1..4} cos(2*Pi*c_i/n).
- a(n) is the number of pairs of integer quadruples (b_1, b_2, b_3, b_4) and (c_1, c_2, c_3, c_4) satisfying 1 <= b_1 < b_2 < b_3 < b_4 < n, 1 <= c_1 < c_2 < c_3 < c_4 < n, b_i != c_j for all i,j = 1,2,3,4 and Product_{i=1..4} sin(2*Pi*b_i/n) = Product_{i=1..4} sin(2*Pi*c_i/n).A063781
a(n) is the number of pairs of integer quadruples (b_1, b_2, b_3, b_4) and (c_1, c_2, c_3, c_4) satisfying 1 <= b_1 < b_2 < b_3 < b_4 < n, 1 <= c_1 < c_2 < c_3 < c_4 < n, b_i != c_j for all i,j = 1,2,3,4 and Product_{i=1..4} sin(2*Pi*b_i/n) = Product_{i=1..4} sin(2*Pi*c_i/n).
- a(0) = 1, a(1) = 3; for n > 1, a(n) = 2*a(n-1) + 4*a(n-2).A063782
a(0) = 1, a(1) = 3; for n > 1, a(n) = 2*a(n-1) + 4*a(n-2).
- Numbers k such that the sum of the cubes of divisors of k is a prime.A063783
Numbers k such that the sum of the cubes of divisors of k is a prime.
- Primes that are the sum of cubes of divisors of some integer.A063784
Primes that are the sum of cubes of divisors of some integer.
- Numbers n such that sigma(n) = 2n + omega(n), where omega(n) is the number of distinct prime divisors of n.A063785
Numbers n such that sigma(n) = 2n + omega(n), where omega(n) is the number of distinct prime divisors of n.
- G.f.: A(x) = (x-2*x^2-2*x^3-(1+x)*sqrt(1-4*x^2)+sqrt(1-4*x^6))/(2*x^2).A063786
G.f.: A(x) = (x-2*x^2-2*x^3-(1+x)*sqrt(1-4*x^2)+sqrt(1-4*x^6))/(2*x^2).
- a(2^k) = k + 1 and a(2^k + i) = 1 + a(i) for k >= 0 and 0 < i < 2^k.A063787
a(2^k) = k + 1 and a(2^k + i) = 1 + a(i) for k >= 0 and 0 < i < 2^k.
- Numbers k such that sigma(k) = 2k + Omega(k), where Omega(n) is the number of prime divisors of n (with repetition).A063788
Numbers k such that sigma(k) = 2k + Omega(k), where Omega(n) is the number of prime divisors of n (with repetition).
- a(n) is the largest prime gap between n^2 and (n+1)^2.A063789
a(n) is the largest prime gap between n^2 and (n+1)^2.
- a(n) is the smallest prime gap between n^2 and (n+1)^2.A063790
a(n) is the smallest prime gap between n^2 and (n+1)^2.
- Numbers k such that 2^(k+1) - k - 2 is prime.A063791
Numbers k such that 2^(k+1) - k - 2 is prime.
- Subtractive primes: p = x1x2x3..xk is a k-digit prime in base 10 such that abs(x1-x2-x3-...-xk) is also a prime.A063792
Subtractive primes: p = x1x2x3..xk is a k-digit prime in base 10 such that abs(x1-x2-x3-...-xk) is also a prime.
- a(n) = Min{ q prime | nextprime(q) - q - 1 = prime(n)}, or 0 if none exist.A063793
a(n) = Min{ q prime | nextprime(q) - q - 1 = prime(n)}, or 0 if none exist.
- Numbers k such that usigma(k) = k + phi(k).A063794
Numbers k such that usigma(k) = k + phi(k).
- Numbers k such that usigma(k) = phi(k)*omega(k), where omega(k) is the number of distinct prime divisors of k.A063795
Numbers k such that usigma(k) = phi(k)*omega(k), where omega(k) is the number of distinct prime divisors of k.
- Numbers k such that phi(sigma(k^3)) is a square.A063796
Numbers k such that phi(sigma(k^3)) is a square.
- Numbers n such that sigma(d(n^3))==d(sigma(n^2)), where d(n) is the number of divisors of n.A063797
Numbers n such that sigma(d(n^3))==d(sigma(n^2)), where d(n) is the number of divisors of n.
- phi(s(n^3)) is a square, where s(n) is sigma(n)-n (A001065).A063798
phi(s(n^3)) is a square, where s(n) is sigma(n)-n (A001065).
- Numbers k such that (k+3, k+5, k+17, k+257, k+65537) are all primes.A063799
Numbers k such that (k+3, k+5, k+17, k+257, k+65537) are all primes.
- Number of nonisomorphic oriented matroids with n points in 2 dimensions.A063800
Number of nonisomorphic oriented matroids with n points in 2 dimensions.
- Number of nonisomorphic oriented matroids with n points in 3 dimensions.A063801
Number of nonisomorphic oriented matroids with n points in 3 dimensions.
- Number of nonisomorphic oriented matroids with n points in 4 dimensions.A063802
Number of nonisomorphic oriented matroids with n points in 4 dimensions.
- Number of nonisomorphic oriented matroids with n points in 5 dimensions.A063803
Number of nonisomorphic oriented matroids with n points in 5 dimensions.
- Triangle T(n,k) (n >= 3, k = 1..n-2) read by rows, giving number of nonisomorphic oriented matroids with n points in n-k dimensions.A063804
Triangle T(n,k) (n >= 3, k = 1..n-2) read by rows, giving number of nonisomorphic oriented matroids with n points in n-k dimensions.
- Number of nonisomorphic oriented matroids with n points in dimensions 2 through n-1.A063805
Number of nonisomorphic oriented matroids with n points in dimensions 2 through n-1.
- Numbers with a prime number of proper divisors.A063806
Numbers with a prime number of proper divisors.
- a(0) = 0, a(n+1) = a(n) + next prime larger than a(n).A063807
a(0) = 0, a(n+1) = a(n) + next prime larger than a(n).
- Spherical growth series for Z as generated by {2, 3}.A063808
Spherical growth series for Z as generated by {2, 3}.
- Spherical growth series for pair of groups, one Gromov hyperbolic, the other not.A063809
Spherical growth series for pair of groups, one Gromov hyperbolic, the other not.
- Growth series for Heisenberg group.A063810
Growth series for Heisenberg group.