Sequences
392,541 sequences
- Positive integers divisible by 5 but not by 7.A067761
Positive integers divisible by 5 but not by 7.
- Numbers n such that bigomega(sigma(n))=bigomega(n).A067762
Numbers n such that bigomega(sigma(n))=bigomega(n).
- Square array read by antidiagonals of base n numbers written as 122...222 with k 2's (and a suitable interpretation for n=0, 1 or 2).A067763
Square array read by antidiagonals of base n numbers written as 122...222 with k 2's (and a suitable interpretation for n=0, 1 or 2).
- Numerators of the coefficients in exp(x/(1-x)) power series.A067764
Numerators of the coefficients in exp(x/(1-x)) power series.
- Order of linear Heyting semi-lattice on n points.A067765
Order of linear Heyting semi-lattice on n points.
- Numbers k such that sigma(k)^2 > 4*sigma_2(k) where sigma_2(k) is the sum of squares over the divisors of k.A067766
Numbers k such that sigma(k)^2 > 4*sigma_2(k) where sigma_2(k) is the sum of squares over the divisors of k.
- Number of alternating link diagrams with n crossings, 2 connected components and two external legs.A067767
Number of alternating link diagrams with n crossings, 2 connected components and two external legs.
- Number of alternating link diagrams with n crossings, 3 connected components and two external legs.A067768
Number of alternating link diagrams with n crossings, 3 connected components and two external legs.
- Number of tiling variants for polyominoes with n cells.A067769
Number of tiling variants for polyominoes with n cells.
- a(n) = Catalan(n) mod (n+2).A067770
a(n) = Catalan(n) mod (n+2).
- Number of vertices in Sierpiński triangle of order n.A067771
Number of vertices in Sierpiński triangle of order n.
- One half of the number of non-self-conjugate balanced partitions.A067772
One half of the number of non-self-conjugate balanced partitions.
- a(n) is the unique positive integer m which has a self-conjugate partition whose parts are the first n primes.A067773
a(n) is the unique positive integer m which has a self-conjugate partition whose parts are the first n primes.
- Primes p such that p+2 is not a prime.A067774
Primes p such that p+2 is not a prime.
- Primes p such that p + 4 is composite.A067775
Primes p such that p + 4 is composite.
- Numbers k such that binomial(2*k,k) * B(2*k) is an integer where B(k) are the Bernoulli numbers B(1)=-1/2 B(2)=1/6 B(4)=-1/30... B(2*m+1)=0 m>1.A067776
Numbers k such that binomial(2*k,k) * B(2*k) is an integer where B(k) are the Bernoulli numbers B(1)=-1/2 B(2)=1/6 B(4)=-1/30... B(2*m+1)=0 m>1.
- Numbers k such that (2*k)! * B(6*k) is an integer where B(k) are the Bernoulli numbers B(1)=-1/2 B(2)=1/6 B(4)=-1/30... B(2*m+1)=0 m>1.A067777
Numbers k such that (2*k)! * B(6*k) is an integer where B(k) are the Bernoulli numbers B(1)=-1/2 B(2)=1/6 B(4)=-1/30... B(2*m+1)=0 m>1.
- Numbers k such that gcd(k, numerator(B(2*k))) is not squarefree where B(2*k) are the Bernoulli numbers.A067778
Numbers k such that gcd(k, numerator(B(2*k))) is not squarefree where B(2*k) are the Bernoulli numbers.
- Primes such that the sum of the squares of its digits is equal to the product of its digits.A067779
Primes such that the sum of the squares of its digits is equal to the product of its digits.
- Numbers n such that sigma(n)/phi(n) is prime.A067780
Numbers n such that sigma(n)/phi(n) is prime.
- Numbers k such that phi(k) and sigma(k) are both perfect squares.A067781
Numbers k such that phi(k) and sigma(k) are both perfect squares.
- Minimal delay time for an n-element sorting network.A067782
Minimal delay time for an n-element sorting network.
- Numbers k such that prime(k+1)^2 == prime(k)^2 (mod k).A067783
Numbers k such that prime(k+1)^2 == prime(k)^2 (mod k).
- Numbers k such that prime(k+1)^4 == prime(k)^4 (mod k).A067784
Numbers k such that prime(k+1)^4 == prime(k)^4 (mod k).
- Numbers k such that prime(k)^3 == prime(k+1)^3 (mod k).A067785
Numbers k such that prime(k)^3 == prime(k+1)^3 (mod k).
- Numbers n such that phi(n) = 2*pi(n) where pi(n) = A000720(n) and phi(n) = A000010(n).A067786
Numbers n such that phi(n) = 2*pi(n) where pi(n) = A000720(n) and phi(n) = A000010(n).
- Numbers n such that the number of primes not exceeding sigma(n) equals phi(n), i.e., pi(sigma(n)) = phi(n).A067787
Numbers n such that the number of primes not exceeding sigma(n) equals phi(n), i.e., pi(sigma(n)) = phi(n).
- Numbers n such that sigma(n) - phi(n) = pi(n).A067788
Numbers n such that sigma(n) - phi(n) = pi(n).
- Numbers k whose last digit is the k-th digit of log(2).A067789
Numbers k whose last digit is the k-th digit of log(2).
- Numbers n such that n and prime(n) end with the same digit.A067790
Numbers n such that n and prime(n) end with the same digit.
- Smallest multidigit prime such that the sum of the squares of its digits is equal to n times the product of its digits, or 0 if no such prime exists.A067791
Smallest multidigit prime such that the sum of the squares of its digits is equal to n times the product of its digits, or 0 if no such prime exists.
- a(n) is the least prime >= sigma(n).A067792
a(n) is the least prime >= sigma(n).
- Nonprimes n such that phi(n) > 2n/3.A067793
Nonprimes n such that phi(n) > 2n/3.
- Nonprime numbers k such that phi(k) > 3*k/4.A067794
Nonprime numbers k such that phi(k) > 3*k/4.
- Numbers k such that 2*k+1 is the next prime after sigma(k).A067795
Numbers k such that 2*k+1 is the next prime after sigma(k).
- Numbers k such that phi(k) + phi(k+1) = k.A067796
Numbers k such that phi(k) + phi(k+1) = k.
- Numbers k such that phi(k) + phi(k+1) = k+2.A067797
Numbers k such that phi(k) + phi(k+1) = k+2.
- Numbers n such that phi(n)+phi(n+1)=n+1.A067798
Numbers n such that phi(n)+phi(n+1)=n+1.
- Numbers k such that phi(k) + phi(k+1) = sigma(k).A067799
Numbers k such that phi(k) + phi(k+1) = sigma(k).
- Nonprime numbers k such that phi(k) > k/2.A067800
Nonprime numbers k such that phi(k) > k/2.
- Numbers m such that bigomega(m)=2*omega(m).A067801
Numbers m such that bigomega(m)=2*omega(m).
- Triangle read by rows: T(n, k) = binomial(2*n+1, n-k)^2*(2*k+1)/(2*n+1).A067802
Triangle read by rows: T(n, k) = binomial(2*n+1, n-k)^2*(2*k+1)/(2*n+1).
- Numbers n such that sigma(n)-sigma(n+1)=n.A067803
Numbers n such that sigma(n)-sigma(n+1)=n.
- Triangle read by rows: T(n,k) is the number of walks (each step +-1) of length 2n which have a cumulative value of 0 last at step 2k.A067804
Triangle read by rows: T(n,k) is the number of walks (each step +-1) of length 2n which have a cumulative value of 0 last at step 2k.
- Numbers n such that the area of the parallelogram formed by the vectors (n, prime(n)) and (n+1, prime(n+1)) is an integer square, i.e., Det[{{n, prime(n)},{n+1, prime(n+1)}}] is an integer square.A067805
Numbers n such that the area of the parallelogram formed by the vectors (n, prime(n)) and (n+1, prime(n+1)) is an integer square, i.e., Det[{{n, prime(n)},{n+1, prime(n+1)}}] is an integer square.
- Numbers n such that sigma(n+1)+sigma(n)=3n.A067806
Numbers n such that sigma(n+1)+sigma(n)=3n.
- Numbers k such that sigma(k)^2 > 2*sigma(k^2).A067807
Numbers k such that sigma(k)^2 > 2*sigma(k^2).
- Numbers k such that sigma(k)^2 > 3*sigma(k^2).A067808
Numbers k such that sigma(k)^2 > 3*sigma(k^2).
- Composite n such that sigma(3*n) < prime(n).A067809
Composite n such that sigma(3*n) < prime(n).
- Composite n such that sigma(2*n) < prime(n).A067810
Composite n such that sigma(2*n) < prime(n).