Sequences
392,541 sequences
- a(n) = A066260(A066260(n)).A066261
a(n) = A066260(A066260(n)).
- a(n) = gcd(n, A066260(n)).A066262
a(n) = gcd(n, A066260(n)).
- Numbers k such that 2^k + 1 has just two distinct prime factors.A066263
Numbers k such that 2^k + 1 has just two distinct prime factors.
- Number of composites < primorial(p) with all prime factors > p.A066264
Number of composites < primorial(p) with all prime factors > p.
- a(n) = number of semiprimes < 10^n.A066265
a(n) = number of semiprimes < 10^n.
- Product of first n primorials + 1.A066266
Product of first n primorials + 1.
- Numbers k such that A066266(k) is prime.A066267
Numbers k such that A066266(k) is prime.
- Product of first n primorials - 1.A066268
Product of first n primorials - 1.
- Indices of primes in A066268.A066269
Indices of primes in A066268.
- Multiples of 24 whose digits also sum to 24.A066270
Multiples of 24 whose digits also sum to 24.
- Numbers n such that A066256(n) = n^2-2*n+2.A066271
Numbers n such that A066256(n) = n^2-2*n+2.
- Number of anti-divisors of n.A066272
Number of anti-divisors of n.
- Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 3.A066273
Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 3.
- Number of endofunctions of [n] such that 1 is not a fixed point.A066274
Number of endofunctions of [n] such that 1 is not a fixed point.
- Number of endofunctions of [n] such that some element is fixed, but 1 is not fixed.A066275
Number of endofunctions of [n] such that some element is fixed, but 1 is not fixed.
- Duplicate of A060253.A066276
Duplicate of A060253.
- Primes p(m) such that a prime number q exists so that p(m)-q = c(m), the m-th composite number.A066277
Primes p(m) such that a prime number q exists so that p(m)-q = c(m), the m-th composite number.
- Least solution to cototient(x) = n!, where cototient(x) = x-phi(x).A066278
Least solution to cototient(x) = n!, where cototient(x) = x-phi(x).
- a(n) = n^n + n + 1.A066279
a(n) = n^n + n + 1.
- a(n) = 1^n + 2^(n+1) + 3^(n+2).A066280
a(n) = 1^n + 2^(n+1) + 3^(n+2).
- Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 4.A066281
Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 4.
- Numbers k such that k = (product of nonzero digits of k) * (sum of digits of k).A066282
Numbers k such that k = (product of nonzero digits of k) * (sum of digits of k).
- Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 6.A066283
Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 6.
- a(n) = A066135(4*n).A066284
a(n) = A066135(4*n).
- a(n) is the minimal difference between primes p and q whose sum is 2n.A066285
a(n) is the minimal difference between primes p and q whose sum is 2n.
- For even n>=4, let f(n)=A066285(n/2) be the minimal difference between primes p and q whose sum is n. This sequence contains the successive maxima of f.A066286
For even n>=4, let f(n)=A066285(n/2) be the minimal difference between primes p and q whose sum is n. This sequence contains the successive maxima of f.
- Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 8.A066287
Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 8.
- Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 24.A066288
Number of 3-dimensional polyominoes (or polycubes) with n cells and rotational symmetry group of order exactly 24.
- Numbers k such that k divides DivisorSigma(2*j-1, k) for all j; i.e., all odd-power-sums of divisors of k are divisible by k.A066289
Numbers k such that k divides DivisorSigma(2*j-1, k) for all j; i.e., all odd-power-sums of divisors of k are divisible by k.
- Numbers m such that DivisorSigma(4*k-2, m) mod m = 0 holds presumably for all k; that is, (4k-2)-power-sums of divisors of m are divisible by m for all k.A066290
Numbers m such that DivisorSigma(4*k-2, m) mod m = 0 holds presumably for all k; that is, (4k-2)-power-sums of divisors of m are divisible by m for all k.
- Numbers m such that DivisorSigma(8*k-4, m) mod m = 0 holds presumably for all k; that is, (8*k-4)-power-sums of divisors of m are divisible by m for all k.A066291
Numbers m such that DivisorSigma(8*k-4, m) mod m = 0 holds presumably for all k; that is, (8*k-4)-power-sums of divisors of m are divisible by m for all k.
- Numbers n such that n divides sigma_(2^k)(n), the sum of the 2^k powers of the divisors of n, for all k>1.A066292
Numbers n such that n divides sigma_(2^k)(n), the sum of the 2^k powers of the divisors of n, for all k>1.
- a(n) = A000203(n)^2 - A001157(n) = sigma(n)^2 - sigma_2(n).A066293
a(n) = A000203(n)^2 - A001157(n) = sigma(n)^2 - sigma_2(n).
- a(n) = A000203(n)^2 - A001157(n) - 2n = sigma(n)^2 - sigma_2(n) - 2n.A066294
a(n) = A000203(n)^2 - A001157(n) - 2n = sigma(n)^2 - sigma_2(n) - 2n.
- Number of Abelian groups of order n minus the number of non-Abelian groups of order n.A066295
Number of Abelian groups of order n minus the number of non-Abelian groups of order n.
- a(n) = floor(n^(1/omega(n))).A066296
a(n) = floor(n^(1/omega(n))).
- Number of ternary squarefree necklaces.A066297
Number of ternary squarefree necklaces.
- a(n) = googol (mod n).A066298
a(n) = googol (mod n).
- Numbers k such that the digits of k (counted with multiplicity) are also digits of binomial(2k,k).A066299
Numbers k such that the digits of k (counted with multiplicity) are also digits of binomial(2k,k).
- Number of n X n matrices with exactly 2 1's in each row, other entries 0.A066300
Number of n X n matrices with exactly 2 1's in each row, other entries 0.
- a(n) = 0 if n is squarefree, otherwise 1 + a(n/rad(n)) where rad = A007947 (squarefree kernel).A066301
a(n) = 0 if n is squarefree, otherwise 1 + a(n/rad(n)) where rad = A007947 (squarefree kernel).
- Reduced partially ordered sets (posets) with n labeled elements.A066302
Reduced partially ordered sets (posets) with n labeled elements.
- Number of connected reduced partially ordered sets (posets) with n labeled elements.A066303
Number of connected reduced partially ordered sets (posets) with n labeled elements.
- Reduced partially ordered sets (posets) with n unlabeled elements.A066304
Reduced partially ordered sets (posets) with n unlabeled elements.
- Number of connected reduced partially ordered sets (posets) with n unlabeled elements.A066305
Number of connected reduced partially ordered sets (posets) with n unlabeled elements.
- Prime numbers such that sum of digits equals product of digits.A066306
Prime numbers such that sum of digits equals product of digits.
- Nonprimes whose sum of digits is equal to its product of digits.A066307
Nonprimes whose sum of digits is equal to its product of digits.
- a(n) = (sum of digits of n) * (product of digits of n).A066308
a(n) = (sum of digits of n) * (product of digits of n).
- Numbers k such that k > (product of digits of k) * (sum of digits of k).A066309
Numbers k such that k > (product of digits of k) * (sum of digits of k).
- Numbers k such that k < (product of digits of k) * (sum of digits of k).A066310
Numbers k such that k < (product of digits of k) * (sum of digits of k).