Sequences
392,541 sequences
- Numbers k such that 40*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056661
Numbers k such that 40*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 90*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056662
Numbers k such that 90*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 80*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056663
Numbers k such that 80*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 80*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056664
Numbers k such that 80*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Number of equivalence classes of n-valued Post functions of 1 variable under action of complementing group C(1,n).A056665
Number of equivalence classes of n-valued Post functions of 1 variable under action of complementing group C(1,n).
- Number of equivalence classes of 4-valued Post functions of n variables under action of semi-direct product of symmetric group S_n and complementing group C(n,4).A056666
Number of equivalence classes of 4-valued Post functions of n variables under action of semi-direct product of symmetric group S_n and complementing group C(n,4).
- Number of equivalence classes of n-valued Post functions of 3 variables under action of semi-direct product of symmetric group S_3 and complementing group C(3,n).A056667
Number of equivalence classes of n-valued Post functions of 3 variables under action of semi-direct product of symmetric group S_3 and complementing group C(3,n).
- Number of equivalence classes of 4-valued Post functions of n variables under action of symmetric group S_n.A056668
Number of equivalence classes of 4-valued Post functions of n variables under action of symmetric group S_n.
- Number of equivalence classes of n-valued Post functions of 3 variables under action of symmetric group S_3.A056669
Number of equivalence classes of n-valued Post functions of 3 variables under action of symmetric group S_3.
- Largest non-unitary prime factor of A001405(n) = binomial(n, floor(n/2)), or 1 if no such prime exists.A056670
Largest non-unitary prime factor of A001405(n) = binomial(n, floor(n/2)), or 1 if no such prime exists.
- 1 + the number of unitary and squarefree divisors of n = number of divisors of reduced squarefree part of n.A056671
1 + the number of unitary and squarefree divisors of n = number of divisors of reduced squarefree part of n.
- Number of unitary and squarefree divisors of n! Also, number of divisors of the special squarefree part of n!, A055773(n).A056672
Number of unitary and squarefree divisors of n! Also, number of divisors of the special squarefree part of n!, A055773(n).
- Number of unitary and squarefree divisors of binomial(n, floor(n/2)). Also the number of divisors of the powerfree part of A001405(n), A056060(n).A056673
Number of unitary and squarefree divisors of binomial(n, floor(n/2)). Also the number of divisors of the powerfree part of A001405(n), A056060(n).
- Number of squarefree divisors which are not unitary. Also number of unitary divisors which are not squarefree.A056674
Number of squarefree divisors which are not unitary. Also number of unitary divisors which are not squarefree.
- Number of non-unitary but squarefree divisors of n!. Also number of unitary but not-squarefree divisors of n!.A056675
Number of non-unitary but squarefree divisors of n!. Also number of unitary but not-squarefree divisors of n!.
- Number of non-unitary but squarefree divisors of binomial(n,floor(n/2)). Also number of nonsquarefree but unitary divisors of binomial(n,floor(n/2)).A056676
Number of non-unitary but squarefree divisors of binomial(n,floor(n/2)). Also number of nonsquarefree but unitary divisors of binomial(n,floor(n/2)).
- Numbers k such that 20*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056677
Numbers k such that 20*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 20*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056678
Numbers k such that 20*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Primes p such that 1 + x + Sum_{q prime <= p} x^q is irreducible over GF(2).A056679
Primes p such that 1 + x + Sum_{q prime <= p} x^q is irreducible over GF(2).
- Numbers k such that 30*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056680
Numbers k such that 30*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 40*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056681
Numbers k such that 40*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 40*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056682
Numbers k such that 40*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 40*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056683
Numbers k such that 40*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 50*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056684
Numbers k such that 50*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 50*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056685
Numbers k such that 50*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 50*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056686
Numbers k such that 50*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 50*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056687
Numbers k such that 50*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 70*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056688
Numbers k such that 70*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 70*R_k + 3, where R_k = 11...1 is the repunit (A002275) of length k.A056689
Numbers k such that 70*R_k + 3, where R_k = 11...1 is the repunit (A002275) of length k.
- a(n) = floor(product_{k=2..n} log(k)).A056690
a(n) = floor(product_{k=2..n} log(k)).
- Number of divisors d of n with gcd(d+1, n) = 1.A056691
Number of divisors d of n with gcd(d+1, n) = 1.
- Number of divisors k of n with gcd(k-1, n) = 1.A056692
Number of divisors k of n with gcd(k-1, n) = 1.
- Numbers k such that 70*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056693
Numbers k such that 70*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 80*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056694
Numbers k such that 80*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 80*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056695
Numbers k such that 80*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 90*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056696
Numbers k such that 90*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- a(n) is least N > 1 congruent to -1,0, or 1 mod i for all i=1,...,n.A056697
a(n) is least N > 1 congruent to -1,0, or 1 mod i for all i=1,...,n.
- Numbers k such that 10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056698
Numbers k such that 10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- First differences are 2,1,-2,3 (repeated).A056699
First differences are 2,1,-2,3 (repeated).
- Numbers k such that 2*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056700
Numbers k such that 2*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 2*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056701
Numbers k such that 2*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 2*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056702
Numbers k such that 2*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers n such that 3*10^n - 1 is prime.A056703
Numbers n such that 3*10^n - 1 is prime.
- Numbers k such that 3*10^k + 1*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056704
Numbers k such that 3*10^k + 1*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 3*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056705
Numbers k such that 3*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 4*10^k + 1*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056706
Numbers k such that 4*10^k + 1*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 4*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056707
Numbers k such that 4*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 4*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056708
Numbers k such that 4*10^k + 7*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Naught-y primes, primes with noughts (or zeros).A056709
Naught-y primes, primes with noughts (or zeros).
- Near-repdigit primes such that all digits are equal except for an end-digit.A056710
Near-repdigit primes such that all digits are equal except for an end-digit.